Optimal Testing of Reed-Muller Codes with an Online Adversary

Esty Kelman, Uri Meir, Kai Zhe Zheng. Optimal Testing of Reed-Muller Codes with an Online Adversary. In Dana Moshkovitz, editor, 41st Computational Complexity Conference, CCC 2026, Lisbon, Portugal, August 3-6, 2026. Volume 383 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. [doi]

Abstract

Abstract is missing.