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 *

128 related articles for article (PubMed ID: 16089814)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  • 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. Exact solutions for diluted spin glasses and optimization problems.
    Franz S; Leone M; Ricci-Tersenghi F; Zecchina R
    Phys Rev Lett; 2001 Sep; 87(12):127209. PubMed ID: 11580554
    [TBL] [Abstract][Full Text] [Related]  

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

    [Next]    [New Search]
    of 7.