Skip to main content
SpringerLink
Log in

Disjoint NP-Pairs from Propositional Proof Systems

  • Conference paper
Theory and Applications of Models of Computation (TAMC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3959))

Abstract

For a proof system P we introduce the complexity class DNPP(P) of all disjoint NP-pairs for which the disjointness of the pair is efficiently provable in the proof system P. We exhibit structural properties of proof systems which make the previously defined canonical NP-pairs of these proof systems hard or complete for DNPP(P). Moreover we demonstrate that non-equivalent proof systems can have equivalent canonical pairs and that depending on the properties of the proof systems different scenarios for DNPP(P) and the reductions between the canonical pairs 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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

  • Atserias, A., Bonet, M.L.: On the automatizability of resolution and related propositional proof systems. In: Computer Science Logic, 16th International Workshop, pp. 569–583 (2002)

    Google Scholar 

  • Beyersdorff, O.: Representable disjoint NP-pairs. In: Proc. 24th Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 122–134 (2004)

    Google Scholar 

  • Beyersdorff, O.: Disjoint NP-pairs from propositional proof systems. Technical Report TR05-083, Electronic Colloquium on Computational Complexity (2005)

    Google Scholar 

  • Bonet, M.L., Pitassi, T., Raz, R.: Lower bounds for cutting planes proofs with small coefficients. The Journal of Symbolic Logic 62(3), 708–728 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  • Bonet, M.L., Pitassi, T., Raz, R.: On interpolation and automatization for Frege systems. SIAM Journal on Computing 29(6), 1939–1967 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  • Buss, S.R.: Bounded Arithmetic. Bibliopolis, Napoli (1986)

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  • Glaßer, C., Selman, A.L., Sengupta, S.: Reductions between disjoint NP-pairs. In: Proc. 19th Annual IEEE Conference on Computational Complexity, pp. 42–53 (2004)

    Google Scholar 

  • Glaßer, C., Selman, A.L., Sengupta, S., Zhang, L.: Disjoint NP-pairs. SIAM Journal on Computing 33(6), 1369–1416 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  • Glaßer, C., Selman, A.L., Zhang, L.: Canonical disjoint NP-pairs of propositional proof systems. In: Proc. 30th International Symposium on the Mathematical Foundations of Computer Science, pp. 399–409 (2005)

    Google Scholar 

  • Grollmann, J., Selman, A.L.: Complexity measures for public-key cryptosystems. SIAM Journal on Computing 17(2), 309–335 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  • Homer, S., Selman, A.L.: Oracles for structural properties: The isomorphism problem and public-key cryptography. Journal of Computer and System Sciences 44(2), 287–301 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  • Köbler, J., Messner, J., Torán, J.: Optimal proof systems imply complete sets for promise classes. Information and Computation 184, 71–92 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  • Krajíček, J.: Bounded Arithmetic, Propositional Logic, and Complexity Theory. In: Encyclopedia of Mathematics and Its Applications, vol. 60. Cambridge University Press, Cambridge (1995)

    Google Scholar 

  • Krajíček, J.: Interpolation theorems, lower bounds for proof systems and independence results for bounded arithmetic. The Journal of Symbolic Logic 62(2), 457–486 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  • Krajíček, J.: Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds. The Journal of Symbolic Logic 69(1), 265–286 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  • Krajíček, J., Pudlák, P.: Propositional proof systems, the consistency of first order theories and the complexity of computations. The Journal of Symbolic Logic 54, 1963–1979 (1989)

    Google Scholar 

  • Krajíček, J., Pudlák, P.: Quantified propositional calculi and fragments of bounded arithmetic. Zeitschrift für mathematische Logik und Grundlagen der Mathematik 36, 29–46 (1990)

    Article  MATH  Google Scholar 

  • Krajíc̃ek, J., Pudlák, P.: Some consequences of cryptographical conjectures for S12 and EF. Information and Computation 140(1), 82–94 (1998)

    Article  MathSciNet  Google Scholar 

  • Pudlák, P.: Lower bounds for resolution and cutting planes proofs and monotone computations. The Journal of Symbolic Logic 62, 981–998 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  • Pudlák, P.: On reducibility and symmetry of disjoint NP-pairs. Theoretical Computer Science 295, 323–339 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  • Razborov, A.A.: On provably disjoint NP-pairs. Technical Report TR94-006, Electronic Colloquium on Computational Complexity (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Humboldt-Universität zu Berlin, 10099, Berlin, Germany

    Olaf Beyersdorff

Authors
  1. Olaf Beyersdorff
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Sciences Department, University of Wisconsin, 53706, Madison, WI, USA

    Jin-Yi Cai

  2. School of Mathematics, University of Leeds, LS2 9JT, Leeds, U.K.

    S. Barry Cooper

  3. State Key Lab. of Computer Science, Institute of Software, Chinese Academy of Sciences,  

    Angsheng Li

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Beyersdorff, O. (2006). Disjoint NP-Pairs from Propositional Proof Systems. In: Cai, JY., Cooper, S.B., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2006. Lecture Notes in Computer Science, vol 3959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11750321_23

Download citation

  • DOI: https://doi.org/10.1007/11750321_23

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-34022-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation