Efficient algorithms for semirandom planted CSPs at the refutation threshold

DOI10.1109/FOCS57990.2023.00026MaRDI QIDQ6942947zbMATH OpenFDO

Authors Peter Manohar, Venkatesan Guruswami, Jun-Ting Hsieh, Pravesh Kothari

Publication date 15 August 2025

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

This page was built for publication: Efficient algorithms for semirandom planted CSPs at the refutation threshold

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6942947)