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). An abstract DMM with this power must satisfy a set of compatible mathematical constraints underlying its practical realization. We prove this by making a connection with the dynamical systems theory. This leads us to a set of physical constraints for poly-resource resolvability. Once the mathematical requirements have been assessed, we propose a practical scheme to solve the above class of problems based on the novel concept …

Go To Publication  →

View arXiv version  →

• All Tags Absence of periodic orbits in digital memcomputing machines with solutions Accelerating Deep Learning with Memcomputing Aircraft Loading Optimization: MemComputing the 5th Airbus Problem Coupled oscillator networks for von Neumann and non von Neumann computing Digital Memcomputing: from Logic to Dynamics to Topology Directed percolation and numerical stability of simulations of digital memcomputing machines Dynamic computing random access memory: A brain-inspired computing paradigm with memelements Efficient solution of Boolean satisfiability problems with digital memcomputing Evidence of an exponential speed-up in the solution of hard optimization problems Global minimization via classical tunneling assisted by collective force field formation Instantons in Self-Organizing Logic Gates MemComputing Integer Linear Programming Memcomputing Numerical Inversion With Self-Organizing Logic Gates Memcomputing: Leveraging memory and physics to compute efficiently Mode-Assisted Unsupervised Learning of Restricted Boltzmann Machines On the Universality of Memcomputing Machines Polynomial-time solution of prime factorization and NP-complete problems with digital memcomputing machines Stress-testing memcomputing on hard combinatorial optimization problems Taming a non-convex landscape with dynamical long-range order: memcomputing the Ising spin-glass Topological Field Theory and Computing with Instantons