Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Logical Foundations of Computer Science — Tver '92 (LFCS 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 620))

Included in the following conference series:

  • 175 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature

  1. Aho A.V., Hopcraft J.E., Ullman J.D., The Design and Analysis of Computer Algorithm. 1976, 535 p.

    Google Scholar 

  2. Garrey M.R., Johnson D.S., A Guide to the Theory of NP-completeness. San Francisco, 1979, 416 p.

    Google Scholar 

  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. Kossovsky N.K., Fundamentals of elementary algorithm theory, (In Russion), 1987, Leningrad University, 152 p.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Math. Mech. Faculty, Saint Petersburg University, 19804, Saint Petersburg, Russia

    N. K. Kossovsky & A. B. Prokhoroff

Authors
  1. N. K. Kossovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. B. Prokhoroff
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Anil Nerode Mikhail Taitslin

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kossovsky, N.K., Prokhoroff, A.B. (1992). The polynomial complexity of conjunctive normal form satisfiability, when the number of conjunctions and negations is limited. In: Nerode, A., Taitslin, M. (eds) Logical Foundations of Computer Science — Tver '92. LFCS 1992. Lecture Notes in Computer Science, vol 620. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023878

Download citation

  • DOI: https://doi.org/10.1007/BFb0023878

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55707-4

  • Online ISBN: 978-3-540-47276-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation