Unsolvable Systems of Equations and Proof Complexity

This abstract discusses algebraic proof systems for the propositional calculus. We present recent results, current research directions , and open problems in this area.

[1]  N. S. Barnett,et al.  Private communication , 1969 .

[2]  Stephen A. Cook,et al.  The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.

[3]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[4]  W. Brownawell.  Bounds for the degrees in the Nullstellensatz , 1987 .

[5]  André Galligo,et al.  Some New Effectivity Bounds in Computational Geometry , 1988, AAECC.

[6]  Jan Krajícek,et al.  Lower bounds on Hilbert's Nullstellensatz and propositional proofs , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[7]  Alexander A. Razborov,et al.  Natural Proofs , 2007 .

[8]  Miklós Ajtai,et al.  Symmetric Systems of Linear Equations modulo p , 1994, Electron. Colloquium Comput. Complex..

[9]  Russell Impagliazzo,et al.  The relative complexity of NP search problems , 1995, STOC '95.

[10]  Russell Impagliazzo,et al.  Using the Groebner basis algorithm to find proofs of unsatisfiability , 1996, STOC '96.

[11]  Paul Beame,et al.  More on the relative strength of counting principles , 1996, Proof Complexity and Feasible Arithmetics.

[12]  Samuel R. Buss.  Lower bounds on Nullstellensatz proofs via designs , 1996, Proof Complexity and Feasible Arithmetics.

[13]  Toniann Pitassi,et al.  On ACC 0 [ p k ] Frege proofs , 1997, STOC 1997.

[14]  Dima Grigoriev,et al.  Tseitin's tautologies and lower bounds for Nullstellensatz proofs , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[15]  Alexander A. Razborov,et al.  Lower bounds for the polynomial calculus , 1998, computational complexity.

[16]  Toniann Pitassi,et al.  Propositional Proof Complexity: Past, Present and Future , 2001, Bull. EATCS.

[17]  Russell Impagliazzo,et al.  The Relative Complexity of NP Search Problems , 1998, J. Comput. Syst. Sci..

[18]  Nicola Galesi.  On the Complexity of Propositional Proof Systems , 2000 .