Progress on Polynomial Identity Testing-II - Perspectives in Computational Complexity - page 142

[Mul11] K. Mulmuley, On P versus NP and geometric complexity theory: dedicated to Sri
Ramakrishna. J. ACM 58 (2), 5 (2011)
[Mul12a] K. Mulmuley, Geometric Complexity Theory V: Equivalence between Blackbox Deran-
domization of Polynomial Identity Testing and Derandomization of Noether's Normal-
ization Lemma (FOCS, 2012), pp. 629-638
[Mul12b] K. Mulmuley, The GCT program toward the P versus NP problem. Commun. ACM
55 (6), 98-107 (2012)
[MV97] M. Mahajan, V. Vinay, Determinant: combinatorics, algorithms, and complexity.
Chicago J. Theor. Comput. Sci. 5 , 730-738 (1997). (Conference version in SODA
1997)
[Nis92] N. Nisan, Pseudorandom generators for space-bounded computation. Combinatorica
12 (4), 449-461 (1992). (Conference version in STOC 1990)
[NN93] J. Naor, M, Naor, Small-bias probability spaces: efficient constructions and applica-
tions. SIAM J. Comput. 22 (4), 838-856 (1993). (Conference version in STOC 1990)
[RS05] R. Raz, A Shpilka, Deterministic polynomial identity testing in non-commutative mod-
els. Comput. Complex. 14 (1), 1-19 (2005). (Conference version in, CCC 2004)
[RY09] R. Raz, A. Yehudayoff, Lower bounds and separations for constant depth multilinear
circuits. Comput. Complex. 18 (2), 171-207 (2009). (Conference version in, CCC 2008)
[Sap13] R. Saptharishi, Unified Approaches to Polynomial Identity Testing and Lower Bounds,
Ph.D. thesis, Department of CSE, IIT Kanpur, India, Apr 2013
[Sax08] N. Saxena, Diagonal circuit identity testing, lower bound. ICALP 1 , 60-71 (2008)
[Sax09] N. Saxena, Progress on polynomial identity testing. Bull. EATCS 90 , 49-79 (2009)
[SS11] N. Saxena, C. Seshadhri, An almost optimal rank bound for depth-3 Identities. SIAM
J. Comput. 40 (1), 200-224 (2011). (Conference version in, CCC 2009)
[SS12] N. Saxena, C. Seshadhri, Blackbox identity testing for bounded top-fanin depth-3 cir-
cuits: the field doesn't matter. SIAM J. Comput. 41 (5), 1285-1298 (2012). (Conference
version in STOC 2011)
[SS13] N. Saxena, C. Seshadhri, From Sylvester-Gallai configurations to rank bounds:
Improved blackbox identity test for depth-3 circuits. J. ACM 60 (5), 33 (2013). (Con-
ference version in STOC 2010)
[SSS09] C. Saha, R. Saptharishi, N. Saxena, in The Power of Depth 2 Circuits over Algebras
(FSTTCS, 2009), pp. 371-382
[SY10] A. Shpilka, A. Yehudayoff, Arithmetic Circuits, A survey of recent results and open
questions. Found. Trends Theor. Comput. Sci. 5 (3-4), 207-388 (2010)
[Tav13] S. Tavenas, in Improved Bounds for Reduction to Depth 4 and Depth 3 (MFCS, 2013),
pp. 813-824
[Vad12] S.P. Vadhan, Pseudorandomness. Found. Trends Theor. Comput. Sci. 7 (1-3), 1-336
(2012)
[Val79] L.G. Valiant, in Completeness classes in algebra (STOC, 1979), pp. 249-261
[VSBR83] L.G. Valiant, S. Skyum, S.J. Berkowitz, C. Rackoff, Fast parallel computation of poly-
nomials using few processors. SIAM J. Comput. 12 (4), 641-644 (1983)
[vzG83] J. von zur Gathen, Factoring Sparse Multivariate Polynomials (FOCS, 1983),

pp. 172-179