Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar. Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random. In Stefano Leonardi, Anupam Gupta 0001, editors, STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022. pages 678-689, ACM, 2022. [doi]
Abstract is missing.