Solving NP-complete Problems Using Quantum Weightless Neuron Nodes.
Fernando M. de Paula NetoTeresa Bernarda LudermirWilson Rosa de OliveiraAdenilton J. da SilvaPublished in: BRACIS (2015)
Keyphrases
- np complete problems
- np complete
- graph coloring
- phase transition
- combinatorial problems
- hard problems
- shortest path
- constraint satisfaction problems
- neural network
- sat problem
- satisfiability problem
- genetic algorithm
- max sat
- constraint satisfaction
- orders of magnitude
- graph structure
- decision problems
- job shop scheduling
- np hard
- multi objective
- lower bound