Quantum Computation and NP-Complete Problems.
Takashi MiharaTetsuro NishinoPublished in: ISAAC (1994)
Keyphrases
- np complete problems
- quantum computation
- np complete
- graph coloring
- phase transition
- hard problems
- combinatorial problems
- sat problem
- decision problems
- satisfiability problem
- np hard
- genetic algorithm
- job shop scheduling
- constraint satisfaction problems
- metaheuristic
- swarm intelligence
- genetic programming
- dynamic programming