On the Automatizability of Resolution and Related Propositional Proof Systems
暂无分享,去创建一个
[1] Pavel Pudlák,et al. Lower bounds for resolution and cutting plane proofs and monotone computations , 1997, Journal of Symbolic Logic.
[2] Samuel R. Buss,et al. A Switching Lemma for Small Restrictions and Lower Bounds for k-DNF Resolution , 2004, SIAM J. Comput..
[3] J. Krajícek. On the weak pigeonhole principle , 2001 .
[4] Stephen A. Cook,et al. An Exponential Lower Bound for the Size of Monotone Real Circuits , 1999, J. Comput. Syst. Sci..
[5] Stephen A. Cook,et al. The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.
[6] Maria Luisa Bonet,et al. Optimality of size-width tradeoffs for resolution , 2001, computational complexity.
[7] Alexander A. Razborov,et al. On provably disjoint NP-pairs , 1994, Electron. Colloquium Comput. Complex..
[8] P. Pudlák. Sets and Proofs: On the Complexity of the Propositional Calculus , 1999 .
[9] Jochen Messner,et al. On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution , 2009, ICALP.
[10] Jirí Sgall,et al. Algebraic models of computation and interpolation for algebraic proof systems , 1996, Proof Complexity and Feasible Arithmetics.
[11] Ran Raz,et al. On Interpolation and Automatization for Frege Systems , 2000, SIAM J. Comput..
[12] Michael Alekhnovich,et al. Minimum propositional proof length is NP-hard to linearly approximate , 2001, Journal of Symbolic Logic.
[13] J. Krajícek. On Methods for Proving Lower Bounds in Propositional Logic , 1997 .
[14] Eli Ben-Sasson,et al. Short proofs are narrow—resolution made simple , 2001, JACM.
[15] Maria Luisa Bonet,et al. On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems , 2000, SIAM J. Comput..
[16] Toniann Pitassi,et al. Simplified and improved resolution lower bounds , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[17] Michael Alekhnovich,et al. Resolution is not automatizable unless W[P] is tractable , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[18] Ran Raz,et al. Lower bounds for cutting planes proofs with small coefficients , 1995, Symposium on the Theory of Computing.
[19] Noga Alon,et al. The monotone circuit complexity of boolean functions , 1987, Comb..
[20] Eli Ben-Sasson,et al. Near Optimal Separation Of Tree-Like And General Resolution , 2004, Comb..
[21] Maria Luisa Bonet,et al. Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution , 2001, ICALP.
[22] Pavel Pudl ak a. On reducibility and symmetry of disjoint NP pairs , 2003 .
[23] Oliver Vornberger,et al. The Complexity of Testing Whether a Graph is a Superconcentrator , 1981, Inf. Process. Lett..
[24] Jan Krajícek,et al. Some Consequences of Cryptographical Conjectures for S12 and EF , 1998, Inf. Comput..
[25] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.
[26] Pavel Pudlák. On reducibility and symmetry of disjoint NP pairs , 2003, Theor. Comput. Sci..
[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] 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.
[29] A. Razborov. Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic , 1995 .
[30] Toniann Pitassi,et al. A new proof of the weak pigeonhole principle , 2000, STOC '00.
[31] Søren Riis,et al. Tree resolution proofs of the weak pigeon-hole principle , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.
[32] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[33] Jan Krajícek,et al. Lower bounds to the size of constant-depth propositional proofs , 1994, Journal of Symbolic Logic.