On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
暂无分享,去创建一个
[1] Stasys Jukna. Combinatorics of Monotone Computations , 1998, Comb..
[2] Endre Szemerédi,et al. Many hard examples for resolution , 1988, JACM.
[3] Alasdair Urquhart,et al. The Complexity of Propositional Proofs , 1995, Bulletin of Symbolic Logic.
[4] Arnold Rosenbloom,et al. Monotone Real Circuits are More Powerful than Monotone Boolean Circuits , 1997, Inf. Process. Lett..
[5] Andreas Goerdt. Unrestricted Resolution versus N-Resolution , 1992, Theor. Comput. Sci..
[6] Armin Haken,et al. The Intractability of Resolution , 1985, Theor. Comput. Sci..
[7] Michael E. Saks,et al. The Efficiency of Resolution and Davis--Putnam Procedures , 2002, SIAM J. Comput..
[8] Stephen A. Cook,et al. The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.
[9] Ran Raz,et al. Separation of the Monotone NC Hierarchy , 1999, Comb..
[10] Jan Krajícek. Interpolation by a Game , 1998, Math. Log. Q..
[11] Pavel Pudlák,et al. Lower bounds for resolution and cutting plane proofs and monotone computations , 1997, Journal of Symbolic Logic.
[12] 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.
[13] Eli Ben-Sasson,et al. Short proofs are narrow—resolution made simple , 2001, JACM.
[14] Jan Kraíček,et al. Interpolation by a Game , 1998 .
[15] Avi Wigderson,et al. Monotone Circuits for Connectivity Require Super-Logarithmic Depth , 1990, SIAM J. Discret. Math..
[16] Maria Luisa Bonet,et al. Exponential separations between restricted resolution and cutting planes proof systems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[17] Peter Clote,et al. On PHP st-connectivity, and odd charged graphs , 1996, Proof Complexity and Feasible Arithmetics.
[18] Stephen A. Cook,et al. An Exponential Lower Bound for the Size of Monotone Real Circuits , 1999, J. Comput. Syst. Sci..
[19] Alasdair Urquhart,et al. Formal Languages]: Mathematical Logic--mechanical theorem proving , 2022 .
[20] Russell Impagliazzo,et al. A lower bound for DLL algorithms for k-SAT (preliminary version) , 2000, SODA '00.
[21] Andreas Goerdt. Regular Resolution Versus Unrestricted Resolution , 1993, SIAM J. Comput..
[22] Jan Krajícek,et al. Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic , 1997, Journal of Symbolic Logic.
[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] Jan Johannsen,et al. Lower Bounds for Monotone Real Circuit Depth and Formula Size and Tree-Like Cutting Planes , 1998, Inf. Process. Lett..
[26] Toniann Pitassi,et al. Simplified and improved resolution lower bounds , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[27] Andreas Goerdt. Davis-Putnam Resolution versus Unrestricted Resolution , 1989, CSL.
[28] Ran Raz,et al. Lower bounds for cutting planes proofs with small coefficients , 1995, Symposium on the Theory of Computing.
[29] William J. Cook,et al. On the complexity of cutting-plane proofs , 1987, Discret. Appl. Math..