BibTeX record conf/lfcs/KossovskyP92

• > Home > 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}
}