110 related articles for article (PubMed ID: 37849117)
1. Self-averaging of digital memcomputing machines.
Primosch D; Zhang YH; Di Ventra M
Phys Rev E; 2023 Sep; 108(3-1):034306. PubMed ID: 37849117
[TBL] [Abstract][Full Text] [Related]
2. Stress-Testing Memcomputing on Hard Combinatorial Optimization Problems.
Sheldon F; Cicotti P; Traversa FL; Di Ventra M
IEEE Trans Neural Netw Learn Syst; 2020 Jun; 31(6):2222-2226. PubMed ID: 31395558
[TBL] [Abstract][Full Text] [Related]
3. Directed percolation and numerical stability of simulations of digital memcomputing machines.
Zhang YH; Di Ventra M
Chaos; 2021 Jun; 31(6):063127. PubMed ID: 34241305
[TBL] [Abstract][Full Text] [Related]
4. Efficient solution of Boolean satisfiability problems with digital memcomputing.
Bearden SRB; Pei YR; Di Ventra M
Sci Rep; 2020 Nov; 10(1):19741. PubMed ID: 33184386
[TBL] [Abstract][Full Text] [Related]
5. Absence of periodic orbits in digital memcomputing machines with solutions.
Di Ventra M; Traversa FL
Chaos; 2017 Oct; 27(10):101101. PubMed ID: 29092447
[TBL] [Abstract][Full Text] [Related]
6. Polynomial-time solution of prime factorization and NP-complete problems with digital memcomputing machines.
Traversa FL; Di Ventra M
Chaos; 2017 Feb; 27(2):023107. PubMed ID: 28249395
[TBL] [Abstract][Full Text] [Related]
7. Memcomputing Numerical Inversion With Self-Organizing Logic Gates.
Manukian H; Traversa FL; Di Ventra M; Manukian H; Traversa FL; Di Ventra M; Di Ventra M; Manukian H; Traversa FL
IEEE Trans Neural Netw Learn Syst; 2018 Jun; 29(6):2645-2650. PubMed ID: 28500012
[TBL] [Abstract][Full Text] [Related]
8. Accelerating deep learning with memcomputing.
Manukian H; Traversa FL; Di Ventra M
Neural Netw; 2019 Feb; 110():1-7. PubMed ID: 30458316
[TBL] [Abstract][Full Text] [Related]
9. Universal Memcomputing Machines.
Traversa FL; Di Ventra M
IEEE Trans Neural Netw Learn Syst; 2015 Nov; 26(11):2702-15. PubMed ID: 25667360
[TBL] [Abstract][Full Text] [Related]
10. Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states.
Traversa FL; Ramella C; Bonani F; Di Ventra M
Sci Adv; 2015 Jul; 1(6):e1500031. PubMed ID: 26601208
[TBL] [Abstract][Full Text] [Related]
11. Designing Ising machines with higher order spin interactions and their application in solving combinatorial optimization.
Bashar MK; Shukla N
Sci Rep; 2023 Jun; 13(1):9558. PubMed ID: 37308674
[TBL] [Abstract][Full Text] [Related]
12. Taming a nonconvex landscape with dynamical long-range order: Memcomputing Ising benchmarks.
Sheldon F; Traversa FL; Di Ventra M
Phys Rev E; 2019 Nov; 100(5-1):053311. PubMed ID: 31869932
[TBL] [Abstract][Full Text] [Related]
13. Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions.
Semenov A; Zaikin O
Springerplus; 2016; 5():554. PubMed ID: 27190753
[TBL] [Abstract][Full Text] [Related]
14. Augmenting an electronic Ising machine to effectively solve boolean satisfiability.
Sharma A; Burns M; Hahn A; Huang M
Sci Rep; 2023 Dec; 13(1):22858. PubMed ID: 38129549
[TBL] [Abstract][Full Text] [Related]
15. The backtracking survey propagation algorithm for solving random K-SAT problems.
Marino R; Parisi G; Ricci-Tersenghi F
Nat Commun; 2016 Oct; 7():12996. PubMed ID: 27694952
[TBL] [Abstract][Full Text] [Related]
16. Asymmetric continuous-time neural networks without local traps for solving constraint satisfaction problems.
Molnár B; Ercsey-Ravasz M
PLoS One; 2013; 8(9):e73400. PubMed ID: 24066045
[TBL] [Abstract][Full Text] [Related]
17. Solving satisfiability problems by fluctuations: the dynamics of stochastic local search algorithms.
Barthel W; Hartmann AK; Weigt M
Phys Rev E Stat Nonlin Soft Matter Phys; 2003 Jun; 67(6 Pt 2):066104. PubMed ID: 16241301
[TBL] [Abstract][Full Text] [Related]
18. Efficient optimization with higher-order ising machines.
Bybee C; Kleyko D; Nikonov DE; Khosrowshahi A; Olshausen BA; Sommer FT
Nat Commun; 2023 Sep; 14(1):6033. PubMed ID: 37758716
[TBL] [Abstract][Full Text] [Related]
19. On the Universality of Memcomputing Machines.
Pei YR; Traversa FL; Di Ventra M
IEEE Trans Neural Netw Learn Syst; 2019 Jun; 30(6):1610-1620. PubMed ID: 30387744
[TBL] [Abstract][Full Text] [Related]
20. Phase transitions of the typical algorithmic complexity of the random satisfiability problem studied with linear programming.
Schawe H; Bleim R; Hartmann AK
PLoS One; 2019; 14(4):e0215309. PubMed ID: 31002678
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
