Counting Random k-SAT near the Satisfiability Threshold

Zongchen Chen, Aditya Lonkar, Chunyang Wang, Kuan Yang, Yitong Yin. Counting Random k-SAT near the Satisfiability Threshold. In Michal Koucký 0001, Nikhil Bansal 0001, editors, Proceedings of the 57th Annual ACM Symposium on Theory of Computing, STOC 2025, Prague, Czechia, June 23-27, 2025. pages 867-878, ACM, 2025. [doi]

Abstract

Abstract is missing.