9 citations · 11 across the 10 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.CC2013★ 2 cited
On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields
Suryajith Chillara, Partha Mukhopadhyay
Recently, Gupta et.al. [GKKS2013] proved that over Q any -variate and -degree polynomial in VP can also be computed by a depth three circuit of size $2^{O(\sqrt{…
cs.CC2013
Depth-4 Lower Bounds, Determinantal Complexity : A Unified Approach
Suryajith Chillara, Partha Mukhopadhyay
Tavenas has recently proved that any n^{O(1)}-variate and degree n polynomial in VP can be computed by a depth-4 circuit of size 2^{O(\sqrt{n}\log n)}. So to prove VP not equal to…