31 citations · 82 across the 22 of their papers we have counts for
Showing 2011 · cs.CCShow all
2 papers · 2 filters
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…
cs.CC2011
Algebraic Independence and Blackbox Identity Testing
Malte Beecken, Johannes Mittmann, Nitin Saxena
Algebraic independence is an advanced notion in commutative algebra that generalizes independence of linear polynomials to higher degree. Polynomials {f_1, ..., f_m} \subset \F[x_1…