The polynomial complexity of conjunctive normal form satisfiability, when the number of conjunctions and negations is limited

  • N. K. Kossovsky
  • A. B. Prokhoroff
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 620)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aho A.V., Hopcraft J.E., Ullman J.D., The Design and Analysis of Computer Algorithm. 1976, 535 p.Google Scholar
  2. 2.
    Garrey M.R., Johnson D.S., A Guide to the Theory of NP-completeness. San Francisco, 1979, 416 p.Google Scholar
  3. 3.
    Kossovsky N.K., A criterium of polynomial lower bounds of combinational complexity, Lecture Notes in Computer Science. V. 278, 1987, pp.244–245.Google Scholar
  4. 4.
    Kossovsky N.K., Fundamentals of elementary algorithm theory, (In Russion), 1987, Leningrad University, 152 p.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • N. K. Kossovsky
    • 1
  • A. B. Prokhoroff
    • 1
  1. 1.Math. Mech. FacultySaint Petersburg UniversitySaint PetersburgRussia

Personalised recommendations