Skip to main navigation Skip to search Skip to main content

Knuth-bendix constraint solving is NP-complete

    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.
    Sort by

    Computer Science

    Engineering