Resolution complexity of independent sets in random graphs

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2001, Pages 52-68

  Beame, Paul ^a   Impagliazzo, Russell ^b   Sabharwal, Ashish ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; ENCODING (SYMBOLS); GRAPH THEORY; MATHEMATICAL MODELS; PROBABILITY; THEOREM PROVING;

CONJUNCTIVE NORMAL FUNCTION; INDEPENDENT SET PROBLEM; SEARCH ALGORITHMS;

COMPUTATIONAL COMPLEXITY;

EID: 0034878476     PISSN: 10930159     EISSN: None     Source Type: Journal    
DOI: 10.1109/CCC.2001.933872     Document Type: Article

References (21)

1. Fast probabilistic algorithms for Hamiltonian circuits and matchings
2. The resolution complexity of random graph k-colorability
3. On the complexity of unsatisfiability of random k-CNF formulas
4. Simplified and improved resolution lower bounds
5. Short proofs are narrow - resolution made simple
6. Lower bounds for cutting planes proofs with small coefficients
7. Determining the stability number of a graph
8. Many hard examples for resolution
9. Using the Gröbner basis algorithm to find proofs of unsatisfiability
10. The relative efficiency of propositional proof systems
11. A machine program for theorem proving
12. The intractability of resolution
13. Upper and lower bounds for tree-like cutting planes proofs
14. Algorithms for solving maximum independent set problem
15. Resolution lower bounds for the weak pigeonhole principle
16. Algorithms for maximum independent sets
17. Finding a maximum clique
18. Finding a maximum independent set
19. On the complexity of derivation in the propositional calculus