![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
BibTeX record conf/icalp/KorovinV01
@inproceedings{DBLP:conf/icalp/KorovinV01, author = {Konstantin Korovin and Andrei Voronkov}, editor = {Fernando Orejas and Paul G. Spirakis and Jan van Leeuwen}, title = {Knuth-Bendix Constraint Solving Is NP-Complete}, booktitle = {Automata, Languages and Programming, 28th International Colloquium, {ICALP} 2001, Crete, Greece, July 8-12, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2076}, pages = {979--992}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-48224-5\_79}, doi = {10.1007/3-540-48224-5\_79}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/KorovinV01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.