Resolution complexity of independent sets in random graphs

We consider the problem of providing a resolution proof of the statement that a given graph with n vertices and /spl Delta/n edges does not contain an independent set of size k. For randomly chosen graphs with constant /spl Delta/, we show that such proofs almost surely require size exponential in n. Further, for /spl Delta/=o(n/sup 1/5/) and any k/spl les/n/5, we show that these proofs almost surely require size 2(n/sup /spl delta//) for some global constant /spl delta/>0, even though the largest independent set in graphs with /spl Delta//spl ap/n/sup 1/5/ is much smaller than n/5. Our result shows that almost all instances of the independent set problem are hard for resolution. It also provides a lower bound on the running time of a certain class of search algorithms for finding a largest independent set in a given graph.

[1]  G. S. Tseitin.  On the Complexity of Derivation in Propositional Calculus , 1983 .

[2]  R. Tarjan.  Finding a Maximum Clique. , 1972 .

[3]  Ran Raz,et al.  Lower bounds for cutting planes proofs with small coefficients , 1995, STOC '95.

[4]  Béla Bollobás,et al.  Random Graphs , 1985 .

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

[6]  John Michael Robson,et al.  Algorithms for Maximum Independent Sets , 1986, J. Algorithms.

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

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

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

[10]  Vasek Chvátal,et al.  Determining the Stability Number of a Graph , 1976, SIAM J. Comput..

[11]  Leslie G. Valiant,et al.  Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.

[12]  Robert E. Tarjan,et al.  Finding a Maximum Independent Set , 1976, SIAM J. Comput..

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

[14]  Armin Haken,et al.  The Intractability of Resolution , 1985, Theor. Comput. Sci..

[15]  Toniann Pitassi,et al.  Simplified and improved resolution lower bounds , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[16]  WigdersonAvi,et al.  Short proofs are narrowresolution made simple , 2001 .

[17]  Michael E. Saks,et al.  On the complexity of unsatisfiability proofs for random k-CNF formulas , 1998, STOC '98.

[18]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.