Nearly All k-SAT Functions Are Unate
József Balogh, Dingding Dong, Bernard Lidický, Nitya Mani, Yufei Zhao
2023年份
4被引次数
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
相关 Paper
- Enumerating k-SAT functionsDingding Dong, Nitya Mani, Yufei ZhaoSODA 2022 · 被引用 1 次
- Boolean Function Monotonicity Testing Requires (Almost) n1/2 QueriesMark Chen, Xi Chen, Hao Cui, William Pires 等STOC 2026
- MAJORITY-3SAT (and Related Problems) in Polynomial TimeShyan Akmal, Ryan WilliamsFOCS 2021 · 被引用 4 次
- Asymptotically Optimal Inapproximability of Ek-SAT ReconfigurationShuichi Hirahara, Naoto OhsakaFOCS 2025 · 被引用 3 次
- Approximating the Distance to Monotonicity of Boolean FunctionsRamesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Erik WaingartenSODA 2020 · 被引用 6 次
