"Knuth-Bendix constraint solving is NP-complete."

Konstantin Korovin, Andrei Voronkov (2005)

Details and statistics

DOI: 10.1145/1055686.1055692

access: closed

type: Journal Article

metadata version: 2018-11-06

a service of  Schloss Dagstuhl - Leibniz Center for Informatics