On reducibility and symmetry of disjoint NP pairs

Theoretical Computer Science

Volumn 295, Issue 1-3, 2003, Pages 323-339

  Pudlák, Pavel ^a,b  

^a MATHEMATICAL INSTITUTE   (Czech Republic)

^b ITI   (Czech Republic)

Author keywords

Cutting planes; Disjoint NP pairs; Polynomial reducibility; Propositional proof systems; Resolution

Indexed keywords

POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

POLYNOMIAL REDUCIBILITY;

COMPUTATIONAL COMPLEXITY;

EID: 0037463541     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00411-5     Document Type: Conference Paper

References (16)

1. M. Alekhnovich, A.A. Razborov, Resolution is not automatizable unless W[P] is tractable, http://genesis.mi.ras.ru/̃razborov/.
2. Andrejev A.E. On a method for obtaining lower bounds for the complexity of individual monotone functions. Soviet Math. Dokl. 31:1985;530-534.
3. Babai L., Gál A., Wigderson A. Superpolynomial lower bounds for monotone span programs. Combinatorica. 19(3):1999;301-319.
4. Bonet M., Pitassi T., Raz R. On interpolation and automatization for Frege systems. SIAM J. Comput. 29(6):2000;1939-1967.
5. Cook S.A., Haken A. An exponential lower bound for the size of monotone real circuits. JCSS. 58:1999;326-335.
6. Cook S.A., Reckhow The relative efficiency of propositional proof systems. J. Symbolic Logic. 44(1):1979;36-50.
7. Grollmann J., Selman A.L. Complexity measures for public-key cryptosystems. SIAM J. Comput. 17(2):1988;309-335.
8. Krajíček J. Bounded Arithmetic, Propositional Logic, and Complexity Theory. 1995;Cambridge University Press, Cambridge.
9. Krajíček J., Pudlák P. Propositional proof systems, the consistency of first order theories and the complexity of computations. J. Symbolic Logic. 54(3):1989;1063-1079.
10. 2 and EF Inform. Comput. 142:1998;82-94.
11. L. Kučera, Cryptography and random graphs, preprint.
12. Lovász L. On the Shannon capacity of graphs. IEEE Trans. Inform. Theory. 25:1979;1-7.
13. P. Pudlák, On the Complexity of Propositional Calculus, Sets and Proofs, Invited papers from Logic Colloquium'97, Cambridge University Press, Cambridge, 1999, pp. 197-218.
14. A.A. Razborov, Lower bounds on the monotone complexity of some Boolean functions, Soviet Math. Dokl. 31, 354-357.
15. A.A. Razborov, On provably disjoint NP pairs, BRICS Report Series RS-94-36, 1994, http://www.brics.dk/RS/94/36/index.html.
16. S. Rudich, Super-bits, Demi-bits, and NP/poly-natural proofs, preprint, http://www.cs.cmu.edu/̃rudich/papers/index.htm.