Hitting Sets and Reconstruction for Dense Orbits in VPe\text{VP}_e and ΣΠΣΣΠΣ Circuits

preprint2021arXivOpen access

Abstract

In this paper we study polynomials in VPe\text{VP}_e (polynomial-sized formulas) and in ΣΠΣΣΠΣ (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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.