Dec 16, 2015 Polynomial-time solution of prime factorization and NP-complete problems with digital memcomputing machines Fabio Lorenzo Traversa, Massimiliano Di Ventra We introduce a class of digital machines, we name Digital Memcomputing Machines, (DMMs) able to solve a wide range of problems including Non-deterministic Polynomial (NP) ones with polynomial resources (in time, space, and energy)….
