On derandomizing the line-point low-degree test
cs.CC, cs.IT, math.IT
Submitted: 2026-11-06
Updated: 2026-11-10
Terminology
Sources
- Closure under factorization from a result of Furstenberg
- Some Improvements to Total Degree Tests
- An Improved Line-Point Low-Degree Test
Related papers
- The Proof Analysis Problem for Constant-Depth Frege
- Hardness of Counting Orderings: Taking Gadget Amplification to the Limit
- Rigorous Low-Degree Implications for Planted Subgraph Detection: Noise and Treewidth
- Parameterized Hardness of Zonotope Containment and Neural Network Verification
- From Block Orthogonality to Decidability in Complex-Weighted Counting CSP
- Random Clocks on Computation Paths: How Far Can They Reach, and When Does Stepping Back Help?