Quasi-polynomial Hitting Sets for Circuits with Restricted Parse Trees

09/10/2017
by   Ramprasad Saptharishi, et al.
0

We study the class of non-commutative Unambiguous circuits or Unique-Parse-Tree (UPT) circuits, and a related model of Few-Parse-Trees (FewPT) circuits (which were recently introduced by Lagarde, Malod and Perifel [LMP16] and Lagarde, Limaye and Srinivasan [LLS17]) and give the following constructions: (1) An explicit hitting set of quasipolynomial size for UPT circuits, (2) An explicit hitting set of quasipolynomial size for FewPT circuits (circuits with constantly many parse tree shapes), (3) An explicit hitting set of polynomial size for UPT circuits (of known parse tree shape), when a parameter of preimage-width is bounded by a constant. The above three results are extensions of the results of [AGKS15], [GKST15] and [GKS16] to the setting of UPT circuits, and hence also generalize their results in the commutative world from read-once oblivious algebraic branching programs (ROABPs) to UPT-set-multilinear circuits. The main idea is to study shufflings of non-commutative polynomials, which can then be used to prove suitable depth reduction results for UPT circuits and thereby allow a careful translation of the ideas in [AGKS15], [GKST15] and [GKS16].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/30/2019

Derandomization from Algebraic Hardness: Treading the Borders

A hitting-set generator (HSG) is a polynomial map Gen:F^k →F^n such that...
research
02/10/2021

Hitting Sets and Reconstruction for Dense Orbits in VP_e and ΣΠΣ Circuits

In this paper we study polynomials in VP_e (polynomial-sized formulas) a...
research
03/08/2023

Descriptive complexity for distributed computing with circuits

We consider distributed algorithms in the realistic scenario where distr...
research
07/17/2018

Near-optimal Bootstrapping of Hitting Sets for Algebraic Models

The classical lemma of Ore-DeMillo-Lipton-Schwartz-Zippel [Ore22,DL78,Zi...
research
01/04/2021

A polynomial time construction of a hitting set for read-once branching programs of width 3

Recently, an interest in constructing pseudorandom or hitting set genera...
research
05/17/2023

Border Complexity of Symbolic Determinant under Rank One Restriction

VBP is the class of polynomial families that can be computed by the dete...
research
02/27/2023

Logical Characterization of Algebraic Circuit Classes over Integral Domains

We present an adapted construction of algebraic circuits over the reals ...

Please sign up or login with your details

Forgot password? Click here to reset