On the satisfiability threshold and clustering of solutions of random 3-SAT formulas (Q955013): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q125756943, #quickstatements; #temporary_batch_1719272490319
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the solution-space geometry of random constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pruning processes and a new characterization of convex geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey propagation as local equilibrium equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all graphs with 1.44n edges are 3-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Upper Bound for the Satisfiability Threshold of Randomr-SAT Formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp thresholds of graph properties, and the $k$-sat problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the unsatisfiability threshold of random 3-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tail bounds for occupancy and the satisfiability threshold conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The probabilistic analysis of a greedy satisfiability algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The unsatisfiability threshold revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the unsatisfiability threshold of random formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new look at survey propagation and its generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4237477 / rank
 
Normal rank

Latest revision as of 20:33, 28 June 2024

scientific article
Language Label Description Also known as
English
On the satisfiability threshold and clustering of solutions of random 3-SAT formulas
scientific article

    Statements

    On the satisfiability threshold and clustering of solutions of random 3-SAT formulas (English)
    0 references
    0 references
    0 references
    18 November 2008
    0 references
    0 references
    random 3-SAT
    0 references
    phase transitions
    0 references
    survey propagation
    0 references
    threshold of satisfiability
    0 references
    first-moment method
    0 references
    0 references
    0 references