Knuth-bendix constraint solving is NP-complete

Konstantin Korovin, Andrei Voronkov

    Research output: Chapter in Book/Conference proceedingConference contribution

    Fingerprint

    Dive into the research topics of 'Knuth-bendix constraint solving is NP-complete'. Together they form a unique fingerprint.

    Computer Science

    Engineering