Near Optimal Separation Of Tree-Like And General Resolution
暂无分享,去创建一个
Eli Ben-Sasson | Avi Wigderson | Russell Impagliazzo | R. Impagliazzo | A. Wigderson | Eli Ben-Sasson
[1] 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).
[2] Russell Impagliazzo,et al. Lower bounds for the polynomial calculus and the Gröbner basis algorithm , 1999, computational complexity.
[3] Armin Haken,et al. The Intractability of Resolution , 1985, Theor. Comput. Sci..
[4] Samuel R. Buss,et al. Resolution Proofs of Generalized Pigeonhole Principles , 1988, Theor. Comput. Sci..
[5] Alasdair Urquhart,et al. Formal Languages]: Mathematical Logic--mechanical theorem proving , 2022 .
[6] Stephen A. Cook,et al. An Observation on Time-Storage Trade Off , 1974, J. Comput. Syst. Sci..
[7] Stephen A. Cook,et al. The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.
[8] Russell Impagliazzo,et al. Using the Groebner basis algorithm to find proofs of unsatisfiability , 1996, STOC '96.
[9] Alasdair Urquhart,et al. The Complexity of Propositional Proofs , 1995, Bulletin of Symbolic Logic.
[10] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[11] Nathan Linial,et al. Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas , 1986, J. Comb. Theory, Ser. A.
[12] Alexander A. Razborov,et al. Natural Proofs , 2007 .
[13] Robert E. Tarjan,et al. Space bounds for a game on graphs , 1976, STOC '76.
[14] G. S. Tseitin. On the Complexity of Derivation in Propositional Calculus , 1983 .
[15] Eli Ben-Sasson,et al. Short proofs are narrow—resolution made simple , 2001, JACM.