"Knuth-Bendix constraint solving is NP-complete"

Konstantin Korovin, Andrei Voronkov (2002)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2020-01-10

a service of  Schloss Dagstuhl - Leibniz Center for Informatics