1 citations · 1 across the 1 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2008
An Almost Optimal Rank Bound for Depth-3 Identities
Nitin Saxena, C. Seshadhri
We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most k^3\log d. The previous best rank bound known was 2^{O(k^2)}(\log d)^{k-2} b…
cs.CC2008
Schemes for Deterministic Polynomial Factoring
Gábor Ivanyos, Marek Karpinski, Nitin Saxena
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects we call m-schemes. We extend the known conditiona…