The Number of Satisfying Assignments of Random Regular<i>k</i>-SAT Formulas (Q3177360): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Q186263 / rank
Normal rank
 
Property / author
 
Property / author: Nicholas C. Wormald / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1611.03236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random <i>k</i>‐SAT: Two Moments Suffice to Cross a Sharp Threshold / rank
 
Normal rank
Property / cites work
 
Property / cites work: The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The condensation phase transition in the regular $k$-SAT model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4401944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An estimate of the remainder in a combinatorial central limit theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic \(k\)-SAT threshold / rank
 
Normal rank
Property / cites work
 
Property / cites work: Going after the k-SAT threshold / rank
 
Normal rank
Property / cites work
 
Property / cites work: The condensation transition in random hypergraph 2-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: An elementary proof of the local central limit theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability threshold for random regular NAE-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Satisfiability Conjecture for Large k / 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: Random Regular Graphs: Asymptotic Distributions and Contiguity / 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: Q4344223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of solutions in random hypergraph 2-colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Threshold of Regular Random k-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all cubic graphs are Hamiltonian / rank
 
Normal rank

Latest revision as of 05:24, 16 July 2024

scientific article
Language Label Description Also known as
English
The Number of Satisfying Assignments of Random Regular<i>k</i>-SAT Formulas
scientific article

    Statements

    The Number of Satisfying Assignments of Random Regular<i>k</i>-SAT Formulas (English)
    0 references
    0 references
    0 references
    24 July 2018
    0 references
    0 references
    0 references