Martingale Inequalities and NP-Complete Problems.
Wansoo T. RheeMichel TalagrandPublished in: Math. Oper. Res. (1987)
Keyphrases
- np complete problems
- np complete
- graph coloring
- phase transition
- sufficient conditions
- sat problem
- hard problems
- decision problems
- combinatorial problems
- planar graphs
- constraint satisfaction
- satisfiability problem
- max sat
- orders of magnitude
- constraint programming
- genetic algorithm
- job shop scheduling
- probability distribution
- learning algorithm