These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
113 related articles for article (PubMed ID: 19391897)
1. From one solution of a 3-satisfiability formula to a solution cluster: frozen variables and entropy. Li K; Ma H; Zhou H Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Mar; 79(3 Pt 1):031102. PubMed ID: 19391897 [TBL] [Abstract][Full Text] [Related]
2. Communities of solutions in single solution clusters of a random K-satisfiability formula. Zhou H; Ma H Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Dec; 80(6 Pt 2):066108. PubMed ID: 20365232 [TBL] [Abstract][Full Text] [Related]
3. Analytical and belief-propagation studies of random constraint satisfaction problems with growing domains. Zhao C; Zhang P; Zheng Z; Xu K Phys Rev E Stat Nonlin Soft Matter Phys; 2012 Jan; 85(1 Pt 2):016106. PubMed ID: 22400624 [TBL] [Abstract][Full Text] [Related]
4. Entropy landscape and non-Gibbs solutions in constraint satisfaction problems. Dall'Asta L; Ramezanpour A; Zecchina R Phys Rev E Stat Nonlin Soft Matter Phys; 2008 Mar; 77(3 Pt 1):031118. PubMed ID: 18517340 [TBL] [Abstract][Full Text] [Related]
5. 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]
6. Maximally flexible solutions of a random K-satisfiability formula. Zhao H; Zhou HJ Phys Rev E; 2020 Jul; 102(1-1):012301. PubMed ID: 32794979 [TBL] [Abstract][Full Text] [Related]
7. 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]
8. Balanced K-satisfiability and biased random K-satisfiability on trees. Sumedha ; Krishnamurthy S; Sahoo S Phys Rev E Stat Nonlin Soft Matter Phys; 2013 Apr; 87(4):042130. PubMed ID: 23826613 [TBL] [Abstract][Full Text] [Related]
9. 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]
10. Counting solutions from finite samplings. Huang H; Zhou H Phys Rev E Stat Nonlin Soft Matter Phys; 2012 Feb; 85(2 Pt 2):026118. PubMed ID: 22463290 [TBL] [Abstract][Full Text] [Related]
11. Satisfiability-unsatisfiability transition in the adversarial satisfiability problem. Bardoscia M; Nagaj D; Scardicchio A Phys Rev E Stat Nonlin Soft Matter Phys; 2014 Mar; 89(3):032128. PubMed ID: 24730811 [TBL] [Abstract][Full Text] [Related]
12. A variable neighborhood Walksat-based algorithm for MAX-SAT problems. Bouhmala N ScientificWorldJournal; 2014; 2014():798323. PubMed ID: 25177732 [TBL] [Abstract][Full Text] [Related]
13. Gibbs states and the set of solutions of random constraint satisfaction problems. Krzakała F; Montanari A; Ricci-Tersenghi F; Semerjian G; Zdeborová L Proc Natl Acad Sci U S A; 2007 Jun; 104(25):10318-23. PubMed ID: 17567754 [TBL] [Abstract][Full Text] [Related]
14. Witness of unsatisfiability for a random 3-satisfiability formula. Wu LL; Zhou HJ; Alava M; Aurell E; Orponen P Phys Rev E Stat Nonlin Soft Matter Phys; 2013 May; 87(5):052807. PubMed ID: 23767584 [TBL] [Abstract][Full Text] [Related]
15. Automated discovery of local search heuristics for satisfiability testing. Fukunaga AS Evol Comput; 2008; 16(1):31-61. PubMed ID: 18386995 [TBL] [Abstract][Full Text] [Related]
16. Algebraic characteristics and satisfiability threshold of random Boolean equations. Guo B; Wei W; Sun Y; Zheng Z Phys Rev E Stat Nonlin Soft Matter Phys; 2010 Mar; 81(3 Pt 1):031122. PubMed ID: 20365712 [TBL] [Abstract][Full Text] [Related]
17. Exact satisfiability threshold for k-satisfiability problems on a Bethe lattice. Krishnamurthy S; Sumedha Phys Rev E Stat Nonlin Soft Matter Phys; 2015 Oct; 92(4):042144. PubMed ID: 26565205 [TBL] [Abstract][Full Text] [Related]
18. 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]
19. Social balance as a satisfiability problem of computer science. Radicchi F; Vilone D; Yoon S; Meyer-Ortmanns H Phys Rev E Stat Nonlin Soft Matter Phys; 2007 Feb; 75(2 Pt 2):026106. PubMed ID: 17358393 [TBL] [Abstract][Full Text] [Related]
20. 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] [Next] [New Search]