Exponential separations between restricted resolution and cutting planes proof systems
暂无分享,去创建一个
Maria Luisa Bonet | Jan Johannsen | Juan Luis Esteban | Nicola Galesi | Jan Johannsen | Nicola Galesi | J. L. Esteban
[1] Jan Johannsen,et al. Lower Bounds for Monotone Real Circuit Depth and Formula Size and Tree-Like Cutting Planes , 1998, Inf. Process. Lett..
[2] Toniann Pitassi,et al. Simplified and improved resolution lower bounds , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[3] William J. Cook,et al. On the complexity of cutting-plane proofs , 1987, Discret. Appl. Math..
[4] Peter Clote,et al. On PHP st-connectivity, and odd charged graphs , 1996, Proof Complexity and Feasible Arithmetics.
[5] Andreas Goerdt,et al. Unrestricted Resolution versus N-Resolution , 1990, MFCS.
[6] Alasdair Urquhart,et al. The Complexity of Propositional Proofs , 1995, Bulletin of Symbolic Logic.
[7] Jan Krajícek. Interpolation by a Game , 1998, Math. Log. Q..
[8] Armin Haken,et al. The Intractability of Resolution , 1985, Theor. Comput. Sci..
[9] Jan Krajícek,et al. Some Consequences of Cryptographical Conjectures for S12 and EF , 1998, Inf. Comput..
[10] Endre Szemerédi,et al. Many hard examples for resolution , 1988, JACM.
[11] Russell Impagliazzo,et al. Upper and lower bounds for tree-like cutting planes proofs , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.
[12] Arnold Rosenbloom,et al. Monotone Real Circuits are More Powerful than Monotone Boolean Circuits , 1997, Inf. Process. Lett..
[13] Russell Impagliazzo,et al. Using the Groebner basis algorithm to find proofs of unsatisfiability , 1996, STOC '96.
[14] Jan Kraíček,et al. Interpolation by a Game , 1998 .
[15] Pavel Pudlák,et al. Lower bounds for resolution and cutting plane proofs and monotone computations , 1997, Journal of Symbolic Logic.
[16] Kazuo Iwama. Complexity of Finding Short Resolution Proofs , 1997, MFCS.
[17] Alasdair Urquhart,et al. Formal Languages]: Mathematical Logic--mechanical theorem proving , 2022 .
[18] Giovanni Mastrobuoni,et al. Preliminary Version , 1994 .
[19] Stasys Jukna. Combinatorics of Monotone Computations , 1998, Comb..
[20] Ran Raz,et al. No feasible interpolation for TC/sup 0/-Frege proofs , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[21] Andreas Goerdt. Regular Resolution Versus Unrestricted Resolution , 1993, SIAM J. Comput..
[22] Stephen A. Cook,et al. An Exponential Lower Bound for the Size of Monotone Real Circuits , 1999, J. Comput. Syst. Sci..
[23] Xudong Fu,et al. Lower bounds on sizes of cutting plane proofs for modular coloring principles , 1996, Proof Complexity and Feasible Arithmetics.
[24] Richard Statman,et al. Logic for computer scientists , 1989 .
[25] Avi Wigderson,et al. Monotone circuits for connectivity require super-logarithmic depth , 1990, STOC '88.
[26] Ran Raz,et al. Separation of the Monotone NC Hierarchy , 1999, Comb..
[27] Jan Krajícek,et al. Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic , 1997, Journal of Symbolic Logic.
[28] Ran Raz,et al. Lower bounds for cutting planes proofs with small coefficients , 1995, Symposium on the Theory of Computing.
[29] Andreas Goerdt. Davis-Putnam Resolution versus Unrestricted Resolution , 1989, CSL.
[30] Stephen A. Cook,et al. The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.
[31] R. Impagliazzo,et al. Lower bounds on Hilbert's Nullstellensatz and propositional proofs , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.