activity
20112021
most citedQuasi-polynomial Hitting-set for Set-depth-Delta Formulas

3 citations · 8 across the 7 of their papers we have counts for

collaborators
Showing 2011Show all

1 paper · 1 filter

cs.CC2011★ 1 cited

Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits

Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi +1

We present a single, common tool to strictly subsume all known cases of polynomial time blackbox polynomial identity testing (PIT) that have been hitherto solved using diverse tool…