124 related articles for article (PubMed ID: 33184386)
1. 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]
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. 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]
4. 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]
5. 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]
6. Order-to-chaos transition in the hardness of random Boolean satisfiability problems.
Varga M; Sumi R; Toroczkai Z; Ercsey-Ravasz M
Phys Rev E; 2016 May; 93(5):052211. PubMed ID: 27300884
[TBL] [Abstract][Full Text] [Related]
7. 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]
8. A multilevel memetic algorithm for large SAT-encoded problems.
Bouhmala N
Evol Comput; 2012; 20(4):641-64. PubMed ID: 22540191
[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. 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]
11. 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]
12. 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]
13. Amoeba-inspired nanoarchitectonic computing: solving intractable computational problems using nanoscale photoexcitation transfer dynamics.
Aono M; Naruse M; Kim SJ; Wakabayashi M; Hori H; Ohtsu M; Hara M
Langmuir; 2013 Jun; 29(24):7557-64. PubMed ID: 23565603
[TBL] [Abstract][Full Text] [Related]
14. Analog Approach to Constraint Satisfaction Enabled by Spin Orbit Torque Magnetic Tunnel Junctions.
Wijesinghe P; Liyanagedera C; Roy K
Sci Rep; 2018 May; 8(1):6940. PubMed ID: 29720596
[TBL] [Abstract][Full Text] [Related]
15. A Structural Entropy Measurement Principle of Propositional Formulas in Conjunctive Normal Form.
Zhang Z; Xu D; Zhou J
Entropy (Basel); 2021 Mar; 23(3):. PubMed ID: 33806451
[TBL] [Abstract][Full Text] [Related]
16. Quantum Algorithm for Variant Maximum Satisfiability.
Alasow A; Jin P; Perkowski M
Entropy (Basel); 2022 Nov; 24(11):. PubMed ID: 36359704
[TBL] [Abstract][Full Text] [Related]
17. Numerical solution-space analysis of satisfiability problems.
Mann A; Hartmann AK
Phys Rev E Stat Nonlin Soft Matter Phys; 2010 Nov; 82(5 Pt 2):056702. PubMed ID: 21230614
[TBL] [Abstract][Full Text] [Related]
18. Applying aspiration in local search for satisfiability.
Peng C; Xu Z; Mei M
PLoS One; 2020; 15(4):e0231702. PubMed ID: 32324765
[TBL] [Abstract][Full Text] [Related]
19. Exponentially hard problems are sometimes polynomial, a large deviation analysis of search algorithms for the random satisfiability problem, and its application to stop-and-restart resolutions.
Cocco S; Monasson R
Phys Rev E Stat Nonlin Soft Matter Phys; 2002 Sep; 66(3 Pt 2B):037101. PubMed ID: 12366297
[TBL] [Abstract][Full Text] [Related]
20. Computing with synthetic protocells.
Courbet A; Molina F; Amar P
Acta Biotheor; 2015 Sep; 63(3):309-23. PubMed ID: 25969126
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
