Sciweavers

260 search results - page 1 / 52
» Resolution Complexity of Independent Sets in Random Graphs
Sort
View
COCO
2001
Springer
101views Algorithms» more  COCO 2001»
13 years 8 months ago
Resolution Complexity of Independent Sets in Random Graphs
Paul Beame, Russell Impagliazzo, Ashish Sabharwal
CC
2007
Springer
13 years 3 months ago
The Resolution Complexity of Independent Sets and Vertex Covers in Random Graphs
Paul Beame, Russell Impagliazzo, Ashish Sabharwal
WDAG
2005
Springer
130views Algorithms» more  WDAG 2005»
13 years 9 months ago
Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, Roger...
WEA
2005
Springer
154views Algorithms» more  WEA 2005»
13 years 9 months ago
Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets in Random Graphs
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
Mark K. Goldberg, D. Hollinger, Malik Magdon-Ismai...
MFCS
1997
Springer
13 years 7 months ago
Resolution Proofs, Exponential Bounds, and Kolmogorov Complexity
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...
Uwe Schöning