Random Resolution Refutations

We study the random resolution refutation system definedin [Buss et al. 2014]. This attempts to capture the notion of a resolution refutation that may make mistakes but is correct most of the time. By proving the equivalence of several different definitions, we show that this concept is robust. On the other hand, if P does not equal NP, then random resolution cannot be polynomially simulated by any proof system in which correctness of proofs is checkable in polynomial time. We prove several upper and lower bounds on the width and size of random resolution refutations of explicit and random unsatisfiable CNF formulas. Our main result is a separation between polylogarithmic width random resolution and quasipolynomial size resolution, which solves the problem stated in [Buss et al. 2014]. We also prove exponential size lower bounds on random resolution refutations of the pigeonhole principle CNFs, and of a family of CNFs which have polynomial size refutations in constant depth Frege.

[1]  Russell Impagliazzo,et al.  A Note on Conservativity Relations among Bounded Arithmetic Theories , 2002, Math. Log. Q..

[2]  J. Kraj.  On the Weak Pigeonhole Principle , 2001 .

[3]  Alexander A. Razborov,et al.  Pseudorandom generators hard for $k$-DNF resolution and polynomial calculus resolution , 2015 .

[4]  Samuel R. Buss,et al.  Fragments of Approximate Counting , 2014, J. Symb. Log..

[5]  Neil Thapen.  A Tradeoff Between Length and Width in Resolution , 2014, Theory Comput..

[6]  Jan Krajícek,et al.  Witnessing Functions in Bounded Arithmetic and Search Problems , 1998, J. Symb. Log..

[7]  Jan Krajícek,et al.  Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic , 1997, Journal of Symbolic Logic.

[8]  Eli Ben-Sasson,et al.  Short proofs are narrow—resolution made simple , 2001, JACM.

[9]  Bala Kalyanasundaram,et al.  The Probabilistic Communication Complexity of Set Intersection , 1992, SIAM J. Discret. Math..

[10]  S. Buss,et al.  Collapsing modular counting in bounded arithmetic and constant depth propositional proofs , 2015 .

[11]  Emil Jerábek.  On Independence of Variants of the Weak Pigeonhole Principle , 2007, J. Log. Comput..

[12]  Miklós Ajtai,et al.  The complexity of the Pigeonhole Principle , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[13]  Alasdair Urquhart,et al.  Simplified Lower Bounds for Propositional Proofs , 1996, Notre Dame J. Formal Log..

[14]  Endre Szemerédi,et al.  Many hard examples for resolution , 1988, JACM.

[15]  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.

[16]  Neil Thapen,et al.  The provably total search problems of bounded arithmetic , 2011 .

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

[18]  Jan Krajícek.  A feasible interpolation for random resolution , 2017, Log. Methods Comput. Sci..

[19]  Jan Krajícek,et al.  NP search problems in low fragments of bounded arithmetic , 2007, J. Symb. Log..

[20]  Jan Krajícek,et al.  Randomized feasible interpolation and monotone circuits with a local oracle , 2016, J. Math. Log..

[21]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

[22]  Jan Krajícek,et al.  Proof complexity in algebraic systems and bounded depth Frege systems with modular counting , 1997, computational complexity.

[23]  Ran Raz,et al.  Monotone circuits for matching require linear depth , 1990, STOC '90.

[24]  Neil Thapen,et al.  The Ordering Principle in a Fragment of Approximate Counting , 2014, TOCL.