On reducibility and symmetry of disjoint NP-Pairs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2136, Issue , 2001, Pages 621-632

  Pudlák, Pavel ^a  

^a MATHEMATICAL INSTITUTE   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS;

DISJOINT NP-PAIRS; NP-COMPLETENESS; PROOF SYSTEM; PROPOSITIONAL CALCULUS; RESOLUTION PROOFS;

FORMAL LOGIC;

EID: 84974667191     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44683-4_54     Document Type: Conference Paper

References (13)

1. M. Alekhnovich and A.A. Razborov, Resolution is Not Automatizable UnlessW[P] is Tractable, http://genesis.mi.ras.ru/~razborov/.
2. L. Babai, A. Gál and A. Wigderson, Superpolynomial lower bounds for monotone span programs, Combinatorica 19 (3), 1999, 301-319.
3. M. Bonet, T. Pitassi and R. Raz, On interpolation and automatization for Frege systems. SIAM J. on Computing 29(6), (2000), 1939-1967.
4. S.A. Cook and A. Haken, An exponential lower bound for the size of monotone real circuits, JCSS 58, (1999), 326-335.
5. S.A. Cook and Reckhow, The relative efficiency of propositional proof systems, J. of Symbolic Logic, 44(1), 36-50.
6. J. Krajíček, Bounded arithmetic, propositional logic, and complexity theory, Cambridge Univ. Press, 1995.
7. J. Krajíček and P. Pudlák, Propositional proof systems, the consistency of first order theories and the complexity of computations, J of Symbolic Logic, 54(3), 1063-1079.
8. 2 and EF. Information and Computation 142, (1998), 82-94
9. L. Kučera, Cryptography and random graphs, preprint.
10. L. Lovász, On the Shannon capacity of graphs, IEEE Trans. Inform. Theory 25, 1979, 1-7.
11. P. Pudlák, On the complexity of propositional calculus, Sets and Proofs, Invited papers from Logic Colloquium’97, Cambridge Univ. Press, 1999, 197-218.
12. A.A. Razborov, Lower bounds on the monotone complexity of some Boolean functions, Soviet Mathem. Doklady 31, 354-357.
13. A. A. Razborov, On provably disjoint NP-pairs, BRICS Report Series RS-94-36, 1994, http://www.brics.dk/RS/94/36/index.html.