Blackbox Polynomial Identity Testing for Depth 3 Circuits
暂无分享,去创建一个
[1] Manindra Agrawal,et al. Primality and identity testing via Chinese remaindering , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[2] Avi Wigderson,et al. Depth-3 arithmetic formulae over fields of characteristic zero , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).
[3] Manindra Agrawal,et al. Proving Lower Bounds Via Pseudo-random Generators , 2005, FSTTCS.
[4] Zeev Dvir,et al. Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits , 2005, STOC '05.
[5] Ran Raz,et al. Deterministic extractors for affine sources over large fields , 2008, Comb..
[6] Vikraman Arvind,et al. The ideal membership problem and polynomial identity testing , 2010, Inf. Comput..
[7] Avi Wigderson,et al. Depth-3 arithmetic circuits over fields of characteristic zero , 2002, computational complexity.
[8] Amir Shpilka,et al. Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.
[9] Vikraman Arvind,et al. The Monomial Ideal Membership Problem and Polynomial Identity Testing , 2007, ISAAC.
[10] Amir Shpilka. Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication Gates , 2009, SIAM J. Comput..
[11] Vijay V. Vazirani,et al. Matching is as easy as matrix inversion , 1987, STOC.
[12] P. Borwein,et al. A survey of Sylvester's problem and its generalizations , 1990 .
[13] Daniel A. Spielman,et al. Randomness efficient identity testing of multivariate polynomials , 2001, STOC '01.
[14] Jacob T. Schwartz,et al. Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.
[15] Salil P. Vadhan,et al. Checking polynomial identities over any field: towards a derandomization? , 1998, STOC '98.
[16] L. M. Kelly,et al. A resolution of the sylvester-gallai problem of J.-P. serre , 1986, Discret. Comput. Geom..
[17] Amir Shpilka,et al. Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-in , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.
[18] M. Edelstein,et al. Bisecants of Finite Collections of Sets in Linear Spaces , 1966, Canadian Journal of Mathematics.
[19] Russell Impagliazzo,et al. Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds , 2003, STOC '03.
[20] Noam D. Elkies,et al. Sylvester–Gallai Theorems for Complex Numbers and Quaternions , 2004, Discret. Comput. Geom..
[21] Neeraj Kayal,et al. Polynomial Identity Testing for Depth 3 Circuits , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).
[22] Richard Zippel,et al. Interpolating Polynomials from Their Values , 1990, J. Symb. Comput..
[23] Nitin Saxena,et al. An Almost Optimal Rank Bound for Depth-3 Identities , 2011, SIAM J. Comput..
[24] Zhi-Zhong Chen,et al. Reducing randomness via irrational numbers , 1997, STOC '97.
[25] Manindra Agrawal,et al. PRIMES is in P , 2004 .
[26] Marek Karpinski,et al. An exponential lower bound for depth 3 arithmetic circuits , 1998, STOC '98.
[27] V. Vinay,et al. Arithmetic Circuits: A Chasm at Depth Four , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[28] Sten Hansen. A Generalization of a Theorem of Sylvester on the Lines Determined by a Finite Point Set. , 1965 .