Random \(k\)-SAT: A tight threshold for moderately growing \(k\) (Q2387184): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57401508, #quickstatements; #temporary_batch_1710199756243
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00493-005-0017-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2025593265 / rank
 
Normal rank

Latest revision as of 19:39, 19 March 2024

scientific article
Language Label Description Also known as
English
Random \(k\)-SAT: A tight threshold for moderately growing \(k\)
scientific article

    Statements

    Random \(k\)-SAT: A tight threshold for moderately growing \(k\) (English)
    0 references
    0 references
    0 references
    26 January 2006
    0 references
    In this paper a random instance \(I\) of \(k\)-SAT with \(n\) variables and \(m\) clauses, where \(k=k(n)\) satisfies \(k-\log_{2}n\rightarrow \infty \) is considered. Let \(m_{0}=-n\ln 2/\ln (1-2^{-k})=(2^{k}+O(1))n\ln 2\), so that \(2^{n}(1-2^{-k})^{m_{0}}=1\) and let \(\epsilon =\epsilon (n)>0\) be such that \(\epsilon n\rightarrow \infty \). Let \(I\) be a random instance of \(k\)-SAT with \(n\) variables and \(m\) clauses. By using the second moment method it is shown that \(\lim _{n\rightarrow \infty }\text{\textbf{Pr}(}I\) is satisfiable)
    0 references
    random \(k\)-SAT
    0 references
    tight threshold
    0 references
    second moment method
    0 references
    0 references

    Identifiers