The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘) (Q4821034): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Survey propagation: An algorithm for satisfiability / 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: Q4012216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thick points for planar Brownian motion and the Erdős-Taylor conjecture on random walk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4391441 / 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: Some problems concerning the structure of random walk paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem / 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: 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: 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: Approximating the unsatisfiability threshold of random formulas / rank
 
Normal rank

Revision as of 14:31, 7 June 2024

scientific article; zbMATH DE number 2106880
Language Label Description Also known as
English
The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘)
scientific article; zbMATH DE number 2106880

    Statements

    The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘) (English)
    0 references
    0 references
    0 references
    7 October 2004
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references