An Improved Line-Point Low-Degree Test
Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Madhu Sudan
Abstract
We prove that the most natural low-degree test for polynomials over finite fields is “robust” in the high-error regime for linear-sized fields. Specifically we consider the “local” agreement of a functionfrom the space of degree-d polynomials, i.e., the expected agreement of the function from univariate degree-d polynomials over a randomly chosen line in, and prove that if this local agreement isfor some fixed, then there is a global degree-d polynomialwith agreement nearlywith. This settles a long-standing open question in the area of low-degree testing, yielding an-query robust test in the “high-error” regime (i.e., when. The previous results in this space either required(Polishchuk & Spielman, STOC 1994), or(Arora & Sudan, Combinatorica 2003), orneeded to measure local distance on 2-dimensional “planes” rather than one-dimensional lines leading to-query complexity (Raz & Safra, STOC 1997). Our analysis follows the spirit of most previous analyses in first analyzing the low-variable caseand then “boot-strapping” to general multivariate settings. Our main technical novelty is a new analysis in the bivariate setting that exploits a previously known connection between multivariate factorization and finding (or testing) low-degree polynomials, in a non “black-box” manner. This connection was used roughly in a black-box manner in the work of Arora & Sudan — and we show that opening up this black box and making some delicate choices in the analysis leads to our essentially optimal analysis. A second contribution is a bootstrapping analysis which manages to lift analyses fordirectly to analyses for general, where previous works needed to work withor— arguably this bootstrapping is significantly simpler than those in prior works.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext b8c678f9-970a-4fe5-a3de-ecf63d43b703Cited by top-tier papers6
- Improved Round-by-round Soundness IOPs via Reed-Muller CodesDor Minzer, Kai Zhe ZhengFOCS 2025 · 3 citations
- Ideals, Macaulay Bases, and PCPsPrashanth Amireddy, Amik Raj Behera, Srikanth Srinivasan, Madhu Sudan et al.STOC 2026 · 2 citations
- Plane vs. Plane Low Degree TestAmey Bhangale, Silas RichelsonSODA 2026 · 2 citations
- High Rate Multivariate Polynomial Evaluation CodesSwastik Kopparty, Mrinal Kumar, Harry ShaSTOC 2025 · 1 citation
- Near Optimal Hardness of Approximating k-CSPDor Minzer, Kai Zhe ZhengSTOC 2026
Builds on3
- Proximity Gaps for Reed-Solomon CodesEli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty et al.FOCS 2020 · 58 citations
- Approaching the Soundness Barrier: A Near Optimal Analysis of the Cube versus Cube TestDor Minzer, Kai ZhengSODA 2023 · 3 citations
- Decoding multivariate multiplicity codes on product setsSiddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu SudanSTOC 2021 · 3 citations
Related papers
- Improved Optimal Testing Results from Global HypercontractivityTali Kaufman, Dor MinzerFOCS 2022 · 4 citations
- A robust version of Hegedus's lemma, with applicationsSrikanth SrinivasanSTOC 2020
- Low Degree Testing over the RealsVipul Arora, Arnab Bhattacharyya, Noah Fleming, Esty Kelman et al.SODA 2023 · 2 citations
- Low Degree Local Correction Over the Boolean CubePrashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan et al.SODA 2025 · 1 citation
- Solving Polynomial Equations Over Finite FieldsHolger Dell, Anselm Haak, Melvin Kallmayer, Leo WennmannSODA 2025
