Konstantin Korovin, Andrei Voronkov
Knuth-Bendix Constraint Solving Is NP-Complete
ICALP, 2001.
@inproceedings{ICALP-2001-KorovinV,
author = "Konstantin Korovin and Andrei Voronkov",
booktitle = "{Proceedings of the 28th International Colloquium on Automata, Languages and Programming}",
doi = "10.1007/3-540-48224-5_79",
isbn = "3-540-42287-0",
pages = "979--992",
publisher = "{Springer-Verlag}",
series = "{Lecture Notes in Computer Science}",
title = "{Knuth-Bendix Constraint Solving Is NP-Complete}",
volume = 2076,
year = 2001,
}











