#### Filter Results:

#### Publication Year

2011

2015

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Consider a random instance I of k-SAT with n variables and m clauses. Suppose that θ, c > 0 are any fixed real numbers. Let k = k(n) ≥ 1 2 + θ log 2 n. We prove that lim n→∞ P r(I is satifiable) = 1 m ≤ 1 − c √ n 2 k n ln 2 0 m ≥ 1 + c √ n 2 k n ln 2.

- ‹
- 1
- ›