Konstantin Korovin, Andrei Voronkov. Knuth-Bendix Constraint Solving Is NP-Complete. In Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen, editors, Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings. Volume 2076 of Lecture Notes in Computer Science, pages 979-992, Springer, 2001. [doi]
@inproceedings{KorovinV01,
title = {Knuth-Bendix Constraint Solving Is NP-Complete},
author = {Konstantin Korovin and Andrei Voronkov},
year = {2001},
url = {http://link.springer.de/link/service/series/0558/bibs/2076/20760979.htm},
tags = {completeness, constraints},
researchr = {https://researchr.org/publication/KorovinV01},
cites = {0},
citedby = {0},
pages = {979-992},
booktitle = {Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings},
editor = {Fernando Orejas and Paul G. Spirakis and Jan van Leeuwen},
volume = {2076},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-42287-0},
}