![](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/lfcs/KossovskyP92
@inproceedings{DBLP:conf/lfcs/KossovskyP92, author = {Nikolai K. Kossovsky and A. B. Prokhoroff}, editor = {Anil Nerode and Michael A. Taitslin}, title = {The Polynominal Complexity of Conjunctive Normal Form Satisfiability, when the Number of Conjunctions and Negations is Limited}, booktitle = {Logical Foundations of Computer Science - Tver '92, Second International Symposium, Tver, Russia, July 20-24, 1992, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {620}, pages = {241--245}, publisher = {Springer}, year = {1992}, url = {https://doi.org/10.1007/BFb0023878}, doi = {10.1007/BFB0023878}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/lfcs/KossovskyP92.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.