Knuth-Bendix constraint solving is NP-complete

The Digital Librarian's Digital Library

DOCIS Documents in Computing and Information Science

Konstantin Korovin, Andrei Voronkov

Journal Title: ACM Transactions on Computer Logic

Date: 2005

Volume: 6

Issue: 2

p. 361 - 388

For further information about this item go to:

This data comes from DBLP

This page is maintained by Angela Cornwell and Thomas Krichel.
It was last updated on 2006-04-12