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.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

130 related articles for article (PubMed ID: 31868433)

  • 1. Theory of Nonequilibrium Local Search on Random Satisfaction Problems.
    Aurell E; Domínguez E; Machado D; Mulet R
    Phys Rev Lett; 2019 Dec; 123(23):230602. PubMed ID: 31868433
    [TBL] [Abstract][Full Text] [Related]  

  • 2. 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]  

  • 3. 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]  

  • 4. Phase diagram of the 1-in-3 satisfiability problem.
    Raymond J; Sportiello A; Zdeborová L
    Phys Rev E Stat Nonlin Soft Matter Phys; 2007 Jul; 76(1 Pt 1):011101. PubMed ID: 17677404
    [TBL] [Abstract][Full Text] [Related]  

  • 5. 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]  

  • 6. 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]  

  • 7. 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]  

  • 8. 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]  

  • 9. 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]  

  • 10. 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]  

  • 11. 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]  

  • 12. Analytic and algorithmic solution of random satisfiability problems.
    Mézard M; Parisi G; Zecchina R
    Science; 2002 Aug; 297(5582):812-5. PubMed ID: 12089451
    [TBL] [Abstract][Full Text] [Related]  

  • 13. 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]  

  • 14. When a local Hamiltonian must be frustration-free.
    Sattath O; Morampudi SC; Laumann CR; Moessner R
    Proc Natl Acad Sci U S A; 2016 Jun; 113(23):6433-7. PubMed ID: 27199483
    [TBL] [Abstract][Full Text] [Related]  

  • 15. 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]  

  • 16. Biased random satisfiability problems: from easy to hard instances.
    Ramezanpour A; Moghimi-Araghi S
    Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Jun; 71(6 Pt 2):066101. PubMed ID: 16089814
    [TBL] [Abstract][Full Text] [Related]  

  • 17. 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]  

  • 18. T-->0 mean-field population dynamics approach for the random 3-satisfiability problem.
    Zhou H
    Phys Rev E Stat Nonlin Soft Matter Phys; 2008 Jun; 77(6 Pt 2):066102. PubMed ID: 18643331
    [TBL] [Abstract][Full Text] [Related]  

  • 19. 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]  

  • 20. 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]  

    [Next]    [New Search]
    of 7.