A sharp threshold for a random constraint satisfaction problem (Q1877674): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2004.05.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2164753468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 2-colorability of random hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The threshold for random k-SAT is 2 <sup>k</sup> (ln 2 - O(k)) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized satisfiability problems: Minimal elements and phase transitions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random 2-SAT: Results and problems / 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: Q4828949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Two Simple Heuristics on a Random Instance ofk-sat / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random \(k\)-SAT: A tight threshold for moderately growing \(k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold for unsatisfiability / 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: Q4411392 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random 2-SAT and unsatisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954175 / rank
 
Normal rank

Latest revision as of 19:08, 6 June 2024

scientific article
Language Label Description Also known as
English
A sharp threshold for a random constraint satisfaction problem
scientific article

    Statements

    A sharp threshold for a random constraint satisfaction problem (English)
    0 references
    0 references
    19 August 2004
    0 references
    Random structures
    0 references
    Constraint satisfaction
    0 references
    Threshold phenomena
    0 references
    Phase transition
    0 references

    Identifiers