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

DOI10.1063/1.4975761zbMath1476.68087arXiv1512.05064OpenAlexW3101291997WikidataQ40447576 ScholiaQ40447576MaRDI QIDQ4642549

Fabio L. Traversa, Massimiliano Di Ventra

Publication date: 23 May 2018

Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.05064

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Gradient-like behavior; isolated (locally maximal) invariant sets; attractors, repellers for topological dynamical systems (37B35) Factorization (11Y05) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (6)

Absence of chaos in digital memcomputing machines with solutions ⋮ Accelerating deep learning with memcomputing ⋮ Projective embedding of dynamical systems: uniform mean field equations ⋮ Absence of periodic orbits in digital memcomputing machines with solutions ⋮ Unnamed Item ⋮ Digital memcomputing: from logic to dynamics to topology

Cites Work

• Computation theory of cellular automata
• Parallel turing machines with one-head control units and cellular automata
• Parallelism in random access machines
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polynomial-time solution of prime factorization and NP-complete problems with digital memcomputing machines