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