activity
20172024
most citedNear-Optimal Bootstrapping of Hitting Sets for Algebraic Models

1 citations · 1 across the 5 of their papers we have counts for

collaborators
Showing 2017Show all

1 paper · 1 filter

cs.CC2017

Quasi-polynomial Hitting Sets for Circuits with Restricted Parse Trees

Ramprasad Saptharishi, Anamay Tengse

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 introdu…