"Knuth-Bendix Constraint Solving Is NP-Complete."

Konstantin Korovin, Andrei Voronkov (2001)

Details and statistics

DOI: 10.1007/3-540-48224-5_79

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-23

a service of  Schloss Dagstuhl - Leibniz Center for Informatics