English

Hitting Sets and Reconstruction for Dense Orbits in $\text{VP}_e$ and $\Sigma\Pi\Sigma$ Circuits

Computational Complexity 2021-02-16 v2

Abstract

In this paper we study polynomials in VPe\text{VP}_e (polynomial-sized formulas) and in ΣΠΣ\Sigma\Pi\Sigma (polynomial-size depth-33 circuits) whose orbits, under the action of the affine group GLnaff(F)\text{GL}_n^{\text{aff}}(\mathbb{F}), are dense\mathit{dense} in their ambient class. We construct hitting sets and interpolating sets for these orbits as well as give reconstruction algorithms. As VP=VNC2\text{VP}=\text{VNC}^2, our results for VPe\text{VP}_e translate immediately to VP\text{VP} with a quasipolynomial blow up in parameters. If any of our hitting or interpolating sets could be made robust\mathit{robust} then this would immediately yield a hitting set for the superclass in which the relevant class is dense, and as a consequence also a lower bound for the superclass. Unfortunately, we also prove that the kind of constructions that we have found (which are defined in terms of kk-independent polynomial maps) do not necessarily yield robust hitting sets.

Cite

@article{arxiv.2102.05632,
  title  = {Hitting Sets and Reconstruction for Dense Orbits in $\text{VP}_e$ and $\Sigma\Pi\Sigma$ Circuits},
  author = {Dori Medini and Amir Shpilka},
  journal= {arXiv preprint arXiv:2102.05632},
  year   = {2021}
}
R2 v1 2026-06-23T23:02:41.986Z