Skip to main navigation
Skip to search
Skip to main content
Research Explorer The University of Manchester Home
Search content at Research Explorer The University of Manchester
Home
Profiles
Research units
Research output
Projects
Impacts
Activities
Press/Media
Prizes
Equipment
Datasets
Student theses
Knuth-bendix constraint solving is NP-complete
Konstantin Korovin
, Andrei Voronkov
Research output
:
Chapter in Book/Conference proceeding
›
Conference contribution
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Knuth-bendix constraint solving is NP-complete'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Computer Science
NP-completeness
100%
polynomial-time algorithm
100%
Engineering
NP-completeness
100%