Information Technology Reference
In-Depth Information
[BMS13] M. Beecken, J. Mittmann, N. Saxena, Algebraic independence and blackbox identity
testing. Inf. Comput.
222
, 2-19, (2013). (Conference version in ICALP 2011)
[CKW11] X. Chen, N. Kayal, A. Wigderson, Partial Derivatives in Arithmetic Complexity (and
beyond). Found. Trends Theor. Comput. Sci.
6
(1-2), 1-138 (2011)
[DS07] Z. Dvir, A. Shpilka, Locally decodable codes with two queries and polynomial identity
testing for depth 3 circuits. SIAM J. Comput.
36
(5), 1404-1434 (2007). (Conference
version in STOC 2005)
[Fis94] I. Fischer, Sums of like powers of multivariate linear forms. Math. Mag.
67
(1), 59-61
(1994)
[For91] K. Forsman, Constructive commutative algebra in nonlinear control theory, Ph.D. the-
sis, Dept. of Electrical Engg., Linköping University, Sweden, 1991
[FS12] M.A. Forbes, A. Shpilka, in
On identity testing of tensors, low-rank recovery and
compressed sensing
(STOC, 2012), pp. 163-172
[FS13a] M.A. Forbes, A. Shpilka, Explicit Noether Normalization for Simultaneous Conjuga-
tion via Polynomial Identity Testing, APPROX-RANDOM, 2013, pp. 527-542
[FS13b] M.A. Forbes, AShpilka, in
Quasipolynomial-time Identity Testing of Non-Commutative
and Read-Once Oblivious Algebraic Branching Programs
(FOCS, 2013)
[FSS13] M.A. Forbes, R. Saptharishi, A. Shpilka, Pseudorandomness for multilinear read-once
algebraic branching programs, in any order. Electron. Colloquium Comput. Complex.
20
, 132 (2013)
[GKKS13] A. Gupta, P. Kamath, N. Kayal, R. Saptharishi, in
Arithmetic circuits: a chasm at depth
three
(FOCS, 2013)
[GR08] A. Gabizon, R. Raz, Deterministic extractors for affine sources over large fields. Com-
binatorica
28
(4), 415-440 (2008). (Conference version in FOCS 2005)
[HS80] J. Heintz, C.-P. Schnorr, in
Testing Polynomials which Are Easy to Compute (Extended
Abstract)
(STOC, 1980), pp. 262-272
[IMZ12] R. Impagliazzo, R.Meka, D. Zuckerman, in
Pseudorandomness from shrinkage
(FOCS,
2012), pp. 111-119
[Jac41] C.G.J. Jacobi, De determinantibus functionalibus. J. Reine Angew. Math.
22
(4), 319-
359 (1841)
[KI04] V. Kabanets, R. Impagliazzo, Derandomizing polynomial identity tests means proving
circuit lower bounds. Comput. Complex.
13
(1-2), 1-46 (2004). (Conference version
in STOC 2003)
[KNP11] V. Kabanets, R. Impagliazzo, Derandomizing polynomial identity tests means proving
circuit lower bounds. Comput. Complex.
13
(1-2), 1-46 (2004). (Conference version
in STOC 2003)
[Koi12] P. Koiran, Arithmetic circuits: The chasm at depth four gets wider. Theor. Comput. Sci.
448
, 56-65 (2012)
[KS07] N. Kayal, N. Saxena, Polynomial identity testing for depth 3 circuits. Comput. Complex.
16
(2), 115-138 (2007). (Conference version in, CCC 2006)
[KS09] N. Kayal, S. Saraf, in
Blackbox polynomial identity testing for depth-
3
circuits
(FOCS,
2009), pp. 198-207
[KS11] Z.S. Karnin, A. Shpilka, Black box polynomial identity testing of generalized depth-3
arithmetic circuits with bounded top fan-in. Combinatorica
31
(3), 333-364 (2011).
(Conference version in, CCC 2008)
[KSS13] N. Kayal, C. Saha, R. Saptharishi, A super-polynomial lower bound for regular arith-
metic formulas. Electron. Colloquium Comput. Complex.
20
, 91 (2013)
[Mit13] J. Mittmann, Independence in Algebraic Complexity Theory, Ph.D. thesis,
Mathematisch-Naturwissenschaftlichen Fakultät der Rheinischen Friedrich-Wilhelms-
Universität Bonn, Germany, Dec 2013
[MSS12] J. Mittmann, N. Saxena, P. Scheiblechner, Algebraic independence in positive
characteristic—A p-adic calculus. Electron. Colloquium Comput. Complex.
TR12-
014
(2012). (accepted in Trans. Amer. Math. Soc. 2013)
