A Proof of the Kahn-Kalai Conjecture
Jinyoung Park, Huy Tuan Pham
2022年份
6被引次数
5顶会引用
摘要
Proving the “expectation-threshold” conjecture of Kahn and Kalai, we show that for any increasing property on a finite set X,equationp_c(F)=O(q(F)(F)),equationwhere and are the threshold and “expectation threshold” of , and is the maximum size of a minimal member of .
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper5
- Optimal thresholds for Latin squares, Steiner Triple Systems, and edge coloringsVishesh Jain, Huy Tuan PhamSODA 2024 · 被引用 5 次
- Nearly Tight Lower Bounds for Relaxed Locally Decodable Codes via Robust DaisiesGuy Goldberg, Tom Gur, Sidhant SaraogiSTOC 2026 · 被引用 5 次
- The Proof Analysis ProblemNoel Arteche, Albert Atserias, Susanna F. de Rezende, Erfan KhanikiFOCS 2025 · 被引用 4 次
- A Sharp Version of Talagrand's Selector Process Conjecture and an Application to Rounding Fractional CoversHuy Tuan PhamSTOC 2025 · 被引用 1 次
- Memory Reallocation with Polylogarithmic OverheadCe JinSTOC 2026 · 被引用 1 次
它引用的顶会 Paper1
相关 Paper
- The query complexity of certificationGuy Blanc, Caleb Koch, Jane Lange, Li-Yang TanSTOC 2022 · 被引用 1 次
- Sharp threshold results for computational complexityLijie Chen, Ce Jin, R. Ryan WilliamsSTOC 2020 · 被引用 2 次
- A Tight Bound for Testing Partition PropertiesAsaf Shapira, Henrique StagniSODA 2024 · 被引用 2 次
- Improved Local Computation Algorithm for Set Cover via SparsificationChristoph Grunau, Slobodan Mitrovic, Ronitt Rubinfeld, Ali VakilianSODA 2020 · 被引用 8 次
- Logics for Sizes with Union or IntersectionCaleb Kisby, Saúl A. Blanco, Alex Kruckman, Lawrence S. MossAAAI 2020 · 被引用 2 次
