output
20002026
most citedMethods for Interpreting and Understanding Deep Neural Networks

2.8k citations

researchers with a paper here
collaborating institutions
Showing 2002Show all

1 paper · 1 filter

cs.LO2002

Knuth-Bendix constraint solving is NP-complete

Konstantin Korovin, Andrei Voronkov

We show the NP-completeness of the existential theory of term algebras with the Knuth-Bendix order by giving a nondeterministic polynomial-time algorithm for solving Knuth-Bendix o…