Login / Signup
A Hardware Relaxation Paradigm for Solving NP-Hard Problems.
Paul Cockshott
Andreas Koltes
John T. O'Donnell
Patrick Prosser
Wim Vanderbauwhede
Published in:
BCS Int. Acad. Conf. (2008)
Keyphrases
</>
np hard problems
combinatorial search
graph coloring
knapsack problem
constraint programming
np hard
combinatorial problems
combinatorial optimization
cost function