Skip to main content
SpringerLink
Log in

On an Optimal Deterministic Algorithm for SAT

  • Conference paper
Computer Science Logic (CSL 1998)

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

Included in the following conference series:

Abstract

J. Krajíc̆ek and P. Pudlák proved that an almost optimal deterministic algorithm for TAUT exists if and only if there exists a p-optimal proof system for TAUT. In this paper we prove that an almost optimal deterministic algorithm for SAT exists if and only if there exists a p-optimal proof system for SAT. Combining Krajícek and Pudlák’s result with our result we show that an optimal deterministic algorithm for SAT exists if and only if both p-optimal proof systems for TAUT and for SAT exist.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balcazar, J.L., Díaz, J., Gabarró, J.: Structural complexity, 2nd edn., vol. I. Springer, Heidelberg (1995)

    MATH  Google Scholar 

  2. Cook, S.A.: The complexity of theorem proving procedures. In: Proc. 3rd ACM Symposium on Theory of Computing, pp. 151–158 (1971)

    Google Scholar 

  3. Cook, S.A., Reckhow, R.A.: The relative efficiency of propositional proof systems. J. Symbolic Logic 44, 36–50 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  4. Köbler, J., Messner, J.: Complete Problems for Promise Classes by Optimal Proof Systems for Test Sets. In: Proceedings of the 13th Annual IEEE Conference on Computational Complexity, pp. 132–140 (1998)

    Google Scholar 

  5. Krajíček, J., Pudlák, P.: Propositional proof systems, the consistency of first order theories and the complexity of computations. J. Symbolic Logic 54, 1063–1079 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  6. Levin, L.A.: Universal sorting problems. Problems of Information Transmission 9, 265–266 (1973)

    Google Scholar 

  7. Messner, J., Torán, J.: Optimal proof systems for Propositional Logic and complete sets. Electronic Colloquium on Computational Complexity (1997), available via http://www.eccc.uni-trier.de/eccc/

  8. Trakhtenbrot, B.A.: A survey of Russian Approaches to Perebor (Brute-Force Search) Algorithms. Annals of the History of Computing 6, 384–400 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  9. Verbitskii, O.V.: Optimal algorithms for co-NP sets and the EXP=NEXP problem. Matematicheskie Zametki M.V. Lomonosov Moscow State University 50, 37–46 (1991)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, University of Białystok, 15-267 Białystok, ul. Akademicka 2, Poland

    Zenon Sadowski

Authors
  1. Zenon Sadowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computing Laboratory, Oxford University, Wolfson Building Parks Road Oxford,, OX1 3QD, United Kingdom

    Georg Gottlob

  2. GREYC, Université de Caen, CNRS, Campus 2, F-14032, Caen cedex, France

    Etienne Grandjean

  3.  ,  

    Katrin Seyr

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sadowski, Z. (1999). On an Optimal Deterministic Algorithm for SAT. In: Gottlob, G., Grandjean, E., Seyr, K. (eds) Computer Science Logic. CSL 1998. Lecture Notes in Computer Science, vol 1584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10703163_13

Download citation

  • DOI: https://doi.org/10.1007/10703163_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65922-8

  • Online ISBN: 978-3-540-48855-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation