By Topic

Resolution complexity of independent sets in random graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Beame, P. ; Dept. of Comput. Sci. & Eng., Washington Univ., Seattle, WA, USA ; Impagliazzo, R. ; Sabharwal, A.

We consider the problem of providing a resolution proof of the statement that a given graph with n vertices and Δn edges does not contain an independent set of size k. For randomly chosen graphs with constant Δ, we show that such proofs almost surely require size exponential in n. Further, for Δ=o(n1/5) and any k⩽n/5, we show that these proofs almost surely require size 2(nδ) for some global constant δ>0, even though the largest independent set in graphs with Δ≈n1/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

Published in:

Computational Complexity, 16th Annual IEEE Conference on, 2001.

Date of Conference:

2001