Nearly All k-SAT Functions Are Unate
József Balogh, Dingding Dong, Bernard Lidický, Nitya Mani, Yufei Zhao
2023Year
4Citations
Abstract
We prove that 1−o(1) fraction of all k-SAT functions on n Boolean variables are unate (i.e., monotone after first negating some variables), for any fixed positive integer k and as n → ∞. This resolves a conjecture by Bollobás, Brightwell, and Leader from 2003.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Related papers
- Enumerating k-SAT functionsDingding Dong, Nitya Mani, Yufei ZhaoSODA 2022 · 1 citation
- Boolean Function Monotonicity Testing Requires (Almost) n1/2 QueriesMark Chen, Xi Chen, Hao Cui, William Pires et al.STOC 2026
- MAJORITY-3SAT (and Related Problems) in Polynomial TimeShyan Akmal, Ryan WilliamsFOCS 2021 · 4 citations
- Asymptotically Optimal Inapproximability of Ek-SAT ReconfigurationShuichi Hirahara, Naoto OhsakaFOCS 2025 · 3 citations
- Approximating the Distance to Monotonicity of Boolean FunctionsRamesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Erik WaingartenSODA 2020 · 6 citations
