132 related articles for article (PubMed ID: 16241301)
1. 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]
2. Behavior of heuristics on large and hard satisfiability problems.
Ardelius J; Aurell E
Phys Rev E Stat Nonlin Soft Matter Phys; 2006 Sep; 74(3 Pt 2):037702. PubMed ID: 17025790
[TBL] [Abstract][Full Text] [Related]
3. Trajectories in phase diagrams, growth processes, and computational complexity: how search algorithms solve the 3-satisfiability problem.
Cocco S; Monasson R
Phys Rev Lett; 2001 Feb; 86(8):1654-7. PubMed ID: 11290216
[TBL] [Abstract][Full Text] [Related]
4. Circumspect descent prevails in solving random constraint satisfaction problems.
Alava M; Ardelius J; Aurell E; Kaski P; Krishnamurthy S; Orponen P; Seitz S
Proc Natl Acad Sci U S A; 2008 Oct; 105(40):15253-7. PubMed ID: 18832149
[TBL] [Abstract][Full Text] [Related]
5. 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]
6. Random K-satisfiability problem: from an analytic solution to an efficient algorithm.
Mézard M; Zecchina R
Phys Rev E Stat Nonlin Soft Matter Phys; 2002 Nov; 66(5 Pt 2):056126. PubMed ID: 12513575
[TBL] [Abstract][Full Text] [Related]
7. Hiding solutions in random satisfiability problems: a statistical mechanics approach.
Barthel W; Hartmann AK; Leone M; Ricci-Tersenghi F; Weigt M; Zecchina R
Phys Rev Lett; 2002 May; 88(18):188701. PubMed ID: 12005728
[TBL] [Abstract][Full Text] [Related]
8. 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]
9. 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]
10. Finite-size scaling in random K-satisfiability problems.
Lee SH; Ha M; Jeon C; Jeong H
Phys Rev E Stat Nonlin Soft Matter Phys; 2010 Dec; 82(6 Pt 1):061109. PubMed ID: 21230646
[TBL] [Abstract][Full Text] [Related]
11. Using Stochastic Spiking Neural Networks on SpiNNaker to Solve Constraint Satisfaction Problems.
Fonseca Guerra GA; Furber SB
Front Neurosci; 2017; 11():714. PubMed ID: 29311791
[TBL] [Abstract][Full Text] [Related]
12. 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]
13. Monte Carlo algorithms are very effective in finding the largest independent set in sparse random graphs.
Angelini MC; Ricci-Tersenghi F
Phys Rev E; 2019 Jul; 100(1-1):013302. PubMed ID: 31499906
[TBL] [Abstract][Full Text] [Related]
14. Simplest random K-satisfiability problem.
Ricci-Tersenghi F; Weigt M; Zecchina R
Phys Rev E Stat Nonlin Soft Matter Phys; 2001 Feb; 63(2 Pt 2):026702. PubMed ID: 11308607
[TBL] [Abstract][Full Text] [Related]
15. Memetic algorithm for real-time combinatorial stochastic simulation optimization problems with performance analysis.
Horng SC; Lin SY; Lee LH; Chen CH
IEEE Trans Cybern; 2013 Oct; 43(5):1495-509. PubMed ID: 23893756
[TBL] [Abstract][Full Text] [Related]
16. Local search methods based on variable focusing for random K-satisfiability.
Lemoy R; Alava M; Aurell E
Phys Rev E Stat Nonlin Soft Matter Phys; 2015 Jan; 91(1):013305. PubMed ID: 25679737
[TBL] [Abstract][Full Text] [Related]
17. Optimization by quantum annealing: lessons from hard satisfiability problems.
Battaglia DA; Santoro GE; Tosatti E
Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Jun; 71(6 Pt 2):066707. PubMed ID: 16089911
[TBL] [Abstract][Full Text] [Related]
18. An efficient and accurate solution methodology for bilevel multi-objective programming problems using a hybrid evolutionary-local-search algorithm.
Deb K; Sinha A
Evol Comput; 2010; 18(3):403-49. PubMed ID: 20560758
[TBL] [Abstract][Full Text] [Related]
19. Quantum adiabatic optimization and combinatorial landscapes.
Smelyanskiy VN; Knysh S; Morris RD
Phys Rev E Stat Nonlin Soft Matter Phys; 2004 Sep; 70(3 Pt 2):036702. PubMed ID: 15524670
[TBL] [Abstract][Full Text] [Related]
20. Amoeba-inspired nanoarchitectonic computing implemented using electrical Brownian ratchets.
Aono M; Kasai S; Kim SJ; Wakabayashi M; Miwa H; Naruse M
Nanotechnology; 2015 Jun; 26(23):234001. PubMed ID: 25990026
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
