Semi-sample-based testers achieve optimal query complexity for Reed-Muller codes against online erasures, improving on prior SODA 2024 results.
A sub-constant error-probability low-degree test, and a sub- constant error-probability PCP characterization of NP
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Optimal Testing of Reed-Muller Codes with an Online Adversary
Semi-sample-based testers achieve optimal query complexity for Reed-Muller codes against online erasures, improving on prior SODA 2024 results.