A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Depth-3 Circuits
2010
2010 IEEE 51st Annual Symposium on Foundations of Computer Science
We study the problem of identity testing for depth-3 circuits of top fanin k and degree d (called ΣΠΣ(k, d) identities). We give a new structure theorem for such identities. A direct application of our theorem improves the known deterministic d k O(k) time black-box identity test over rationals (Kayal & Saraf, FOCS 2009) to one that takes d O(k 2 ) -time. Our structure theorem essentially says that the number of independent variables in a real depth-3 identity is very small. This theorem
doi:10.1109/focs.2010.9
dblp:conf/focs/SaxenaS10
fatcat:hyibfk6frbftfikh7zzpkmiasq