Polynomial-time solution of prime factorization and NP-hard problems with digital memcomputing machines.

Fabio L. Traversa Massimiliano Di Ventra

Published in: CoRR (2015)

Keyphrases

np hard problems
constraint programming
knapsack problem
np hard
genetic algorithm
optimal solution
special case
integer programming
computational complexity
worst case
search strategy