NP-completeness of combinatorial problems with unary notation for integers.
Martti PenttonenPublished in: Fundam. Informaticae (1980)
Keyphrases
- combinatorial problems
- constraint programming
- traveling salesman problem
- metaheuristic
- constraint satisfaction problems
- combinatorial optimization
- constraint satisfaction
- pairwise
- phase transition
- graph coloring
- solving hard
- hard combinatorial optimization problems
- global constraints
- branch and bound algorithm
- boolean satisfiability
- genetic algorithm
- constraint propagation
- combinatorial search
- worst case
- specific problems
- search space
- constraint solvers