The satisfiability conjecture for random k-SAT formulas. Human-friendly exposition of the recent OpenAI resolution
math.PR, cond-mat.stat-mech, cs.DM
Submitted: 2026-11-06
Updated: 2026-11-06
Code: https://github.com/openai/math
Terminology
Related papers
- Rank-One HCIZ Integrals and Multiplicative Convolutions
- Repeated averaging on random d-regular graphs
- Precise cover times for branching random walks on Hamming graphs: (iterated) logarithmic corrections
- Markov Chain CLTs: Resolving Open Problems
- Marked stable L'evy processes in Brownian local time
- A Sharp Refinement of Samuels' Inequality via Cap Moves