Login / Signup
Memcomputing NP-complete problems in polynomial time using polynomial resources.
Fabio L. Traversa
Chiara Ramella
Fabrizio Bonani
Massimiliano Di Ventra
Published in:
CoRR (2014)
Keyphrases
</>
np complete problems
np complete
phase transition
graph coloring
suboptimal solutions
special case
polynomial size
resource constraints
computational complexity
hard problems
polynomial hierarchy
worst case
np hard
orders of magnitude
sat problem
genetic algorithm
neural network