Average case complete problems
SIAM Journal on Computing
Almost all k-colorable graphs are easy to color
Journal of Algorithms
Kolmogorov complexity and its applications
Handbook of theoretical computer science (vol. A)
Average case complexity under the universal distribution equals worst-case complexity
Information Processing Letters
On the greedy algorithm for satisfiability
Information Processing Letters
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Artificial Intelligence - Special volume on constraint-based reasoning
An introduction to Kolmogorov complexity and its applications
An introduction to Kolmogorov complexity and its applications
The hardest constraint problems: a double phase transition
Artificial Intelligence
Exploiting the deep structure of constraint problems
Artificial Intelligence
New methods to color the vertices of a graph
Communications of the ACM
Information and Randomness: An Algorithmic Perspective
Information and Randomness: An Algorithmic Perspective
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Combining Hill Climbing and Forward Checking for Handling Disjunctive Constraints
Constraint Processing, Selected Papers
Systematic Generation of Very Hard Cases for Graph 3-Colorability
TAI '95 Proceedings of the Seventh International Conference on Tools with Artificial Intelligence
Where the really hard problems are
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Which search problems are random?
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Constructive generation of very hard 3-colorability instances
Discrete Applied Mathematics
An experimental study of phase transitions in matching
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
We show that the algorithms which behave well on average may have difficulty only for highly structured, non-random inputs, except in a finite number of cases. The formal framework is provided by the theory of Kolmogorov complexity. An experimental verification is done for graph 3-colorability with Brelaz's algorithm.