Cargando…
Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states
Memcomputing is a novel non-Turing paradigm of computation that uses interacting memory cells (memprocessors for short) to store and process information on the same physical platform. It was recently proven mathematically that memcomputing machines have the same computational power of nondeterminist...
Autores principales: | Traversa, Fabio Lorenzo, Ramella, Chiara, Bonani, Fabrizio, Di Ventra, Massimiliano |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
American Association for the Advancement of Science
2015
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4646770/ https://www.ncbi.nlm.nih.gov/pubmed/26601208 http://dx.doi.org/10.1126/sciadv.1500031 |
Ejemplares similares
-
Efficient solution of Boolean satisfiability problems with digital memcomputing
por: Bearden, Sean R. B., et al.
Publicado: (2020) -
Polynomials and polynomial inequalities
por: Borwein, Peter, et al.
Publicado: (1995) -
Nondifferentiable optimization and polynomial problems
por: Shor, Naum Z
Publicado: (1998) -
The Trigonometric Polynomial Like Bernstein Polynomial
por: Han, Xuli
Publicado: (2014) -
Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness
por: Baltean-Lugojan, Radu, et al.
Publicado: (2017)