works on
ACC^0 1approximation theory 1circuit complexity 1linear programming 1majority function 1torus polynomials 1

From the 1 of 1 linked paper with an AI index.

collaborators

1 paper

cs.CC2026

Degree Lower Bounds for Torus Polynomials and vs

Vaibhav Krishan, Sundar Vishwanathan

The paper studies lower bounds on the degree of torus polynomial approximations for Boolean functions, reducing the Majority‑vs‑ACC^0 conjecture to a family of linear programs and…