Revision #1 Authors: Ramprasad Saptharishi, Anamay Tengse

Accepted on: 26th October 2017 11:39

Downloads: 641

Keywords:

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:

• An explicit hitting set of quasipolynomial size for UPT circuits,

• An explicit hitting set of quasipolynomial size for FewPT circuits (circuits with constantly many parse tree shapes),

• 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].

It was brought to our notice that Arvind and Raja [AR16] had studied lower bounds for multiple variants of set-multilinear circuits. Also, the key ideas that we use in the depth reduction of non-commutative UPT circuits were present in the above mentioned work for the case of commutative UPT set-multilinear circuits. In this revision we add references to their work in the rightful places.

TR17-135 Authors: Ramprasad Saptharishi, Anamay Tengse

Publication: 10th September 2017 15:44

Downloads: 1097

Keywords:

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:

• An explicit hitting set of quasipolynomial size for UPT circuits,

• An explicit hitting set of quasipolynomial size for FewPT circuits (circuits with constantly many parse tree shapes),

• 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].