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 *

127 related articles for article (PubMed ID: 11308607)

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

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

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

  • 5. Statistical mechanics of the quantum K -satisfiability problem.
    Knysh S; Smelyanskiy VN
    Phys Rev E Stat Nonlin Soft Matter Phys; 2008 Dec; 78(6 Pt 1):061128. PubMed ID: 19256823
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

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

  • 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. Critical behavior in the satisfiability of random boolean expressions.
    Kirkpatrick S; Selman B
    Science; 1994 May; 264(5163):1297-301. PubMed ID: 17780846
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 17. Relaxation and metastability in a local search procedure for the random satisfiability problem.
    Semerjian G; Monasson R
    Phys Rev E Stat Nonlin Soft Matter Phys; 2003 Jun; 67(6 Pt 2):066103. PubMed ID: 16241300
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

    [Next]    [New Search]
    of 7.