Preprint in the OpenAI Math release
Variance of the Random k-SAT Hitting Time
OpenAI
Abstract
Let H be the index of the first unsatisfiable prefix in random k-SAT on n variables, with independent uniformly signed clauses using k distinct variables and sampled with replacement. For every fixed k ≥ 4, we prove . For k = 3, the variance is bounded below by a positive multiple of n and above by a constant multiple of ; the companion paper on random 3-SAT sharpens this to . The same upper bounds proved here hold after clipping at any fixed positive multiple of n.
open until 1 Jan 2028
est. 50% chance this result is independently verified by the end of 2027.
Not verified 50%Verified 50%
What do you think this paper will get?
All positions stay anonymous.
Discussion (0)
Sign in to comment.