Isomorphisms of NP Complete Problems on Random Instances.
Jay BelangerJie WangPublished in: Computational Complexity Conference (1993)
Keyphrases
- np complete problems
- random instances
- np complete
- phase transition
- graph coloring
- hard problems
- sat problem
- constraint satisfaction
- search algorithm
- satisfiability problem
- combinatorial problems
- multi objective
- dynamic programming
- optimization problems
- np hard
- constraint satisfaction problems
- hyper heuristics
- computational complexity