Single-Variable Connectivity in Random k-SAT
cs.DS, cs.DM
Submitted: 2026-11-04
Updated: 2026-11-04
Terminology
Sources
- Counting random $k$-SAT near the satisfiability threshold
- From algorithms to connectivity and back: finding a giant component in random k-SAT
- Reconstruction of colourings without freezing
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time