Memcomputing NP -complete problems in polynomial time using polynomial resources and collective states

• DOI: 10.1126/sciadv.1500031
• Publication Date: 2015-07-04T03:00:39Z
• Authors: Fabio Lorenzo Tra...; Chiara Ramella; Fabrizio Bonani; Massimiliano Di V...
• Keywords: FOS: Computer and information sciences; Memcomputing; memory; memristors; neural computing; nondeterministic polynomial (NP)-complete; subset-sum problem (SSP); Neurosciences; Computer Science - Emerging Technologies; Computer Science - Neural and Evolutionary Computing; 02 engineering and technology; memory devices; 01 natural sciences; 004; Machine Learning; computing; cs.ET; Emerging Technologies (cs.ET); Mecomputing; Memory; Information and Computing Sciences; Electronic circuits; 0103 physical sciences; non Turing Machine; cs.NE; Neural and Evolutionary Computing (cs.NE); 0210 nano-technology; Research Articles

Demonstration of computing with memory points to a new route for solving hard problems faster.