A review of "Memcomputing NP-complete problems in polynomial time using polynomial resources" (arXiv: 1411.4798).

Published in: CoRR (2014)

Keyphrases

np complete problems
np complete
phase transition
polynomial size
graph coloring
random instances
polynomial hierarchy
suboptimal solutions
special case
computational complexity
hard problems
worst case
combinatorial optimization
cellular automata
np hard
artificial neural networks
lower bound