Variance of the Random k-SAT Hitting Time
For every fixed integer , let be the first unsatisfiable prefix index in random -SAT on variables with independent uniform proper -clauses, and let . With for and for , and , there exist constants such that for all and for all sufficiently large . For every fixed there is such that for all , and if , then for all sufficiently large (with the size cutoff allowed to depend on and ).
All four parts of Theorem 1.1 are rigorously established in Sections 2-6.
“There are constants Ck, ck > 0 such that Var(Hn) ≤ Cknℓk(n) (n ≥ k), Var(Hn) ≥ ckn for all sufficiently large n. For every fixed B > 0 there is Ck,B < ∞ such that Var(Tn,B) ≤ Ck,Bnℓk(n) (n ≥ k). If B > Uk, then also Var(Tn,B) ≥ ckn for all sufficiently large n, with the size cutoff allowed to depend on k and B.” · Show in paper