That really is a hard problem you've spent six months working on: A tutorial on NP-complete problems.
George S. LuekerEdward L. RobertsonPublished in: ACM Annual Conference (1981)
Keyphrases
- np complete problems
- hard problems
- np complete
- random instances
- graph coloring
- phase transition
- sat problem
- combinatorial problems
- combinatorial optimization
- evolutionary algorithm
- decision problems
- neural network
- cellular automata
- satisfiability problem
- randomly generated
- decision makers
- multi objective
- special case
- search space
- genetic algorithm