M. Agrawal and V. Vinay, Arithmetic Circuits: A Chasm at Depth Four, 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pp.67-75, 2008.
DOI : 10.1109/FOCS.2008.32

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.141.7310

J. Alexander and A. Hirschowitz, Polynomial interpolation in several variables, Journal of Algebraic Geometry, vol.4, issue.2, pp.201-222, 1995.

K. Atkinson and A. Sharma, A Partial Characterization of Poised Hermite???Birkhoff Interpolation Problems, SIAM Journal on Numerical Analysis, vol.6, issue.2, pp.230-235, 1969.
DOI : 10.1137/0706021

M. Brambilla and G. Ottaviani, On the Alexander???Hirschowitz theorem, Journal of Pure and Applied Algebra, vol.212, issue.5, pp.1229-1251, 2008.
DOI : 10.1016/j.jpaa.2007.09.014

P. Bürgisser and F. Cucker, Condition: The geometry of numerical algorithms, 2013.
DOI : 10.1007/978-3-642-38896-5

E. Carlini, M. V. Catalisano, and A. Geramita, The solution to the Waring problem for monomials and the sum of coprime monomials, Journal of Algebra, vol.370, pp.5-14, 2012.
DOI : 10.1016/j.jalgebra.2012.07.028

H. Fournier, N. Limaye, G. Malod, and S. Srinivasan, Lower bounds for depth 4 formulas computing iterated matrix multiplication, Proceedings of the 46th Annual ACM Symposium on Theory of Computing, pp.128-135, 2014.
DOI : 10.1145/2591796.2591824

A. Gupta, P. Kamath, N. Kayal, and R. Saptharishi, Approaching the chasm at depth four, Proceedings of the Conference on Computational Complexity (CCC), 2013.

A. Gupta, P. Kamath, N. Kayal, and R. Saptharishi, Arithmetic Circuits: A Chasm at Depth Three, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013.
DOI : 10.1109/FOCS.2013.68

N. Kayal, P. Koiran, T. Pecatte, and C. Saha, Lower Bounds for Sums of Powers of Low Degree Univariates, Proc. 42nd International Colloquium on Automata, Languages and Programming (ICALP 2015), part I, pp.810-821, 2015.
DOI : 10.1007/978-3-662-47672-7_66

N. Kayal, N. Limaye, C. Saha, and S. Srinivasan, An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas, Foundations of Computer Science (FOCS), 2014 IEEE 55th Annual Symposium on, pp.61-70, 2014.
DOI : 10.1137/151002423

N. Kayal, C. Saha, and R. Saptharishi, A super-polynomial lower bound for regular arithmetic formulas, Proceedings of the 46th Annual ACM Symposium on Theory of Computing, STOC '14, pp.146-153, 2014.
DOI : 10.1145/2591796.2591847

P. Koiran, Arithmetic circuits: The chasm at depth four gets wider, Theoretical Computer Science, vol.448, pp.56-65
DOI : 10.1016/j.tcs.2012.03.041

URL : https://hal.archives-ouvertes.fr/ensl-00494642

M. Kumar and S. Saraf, On the power of homogeneous depth 4 arithmetic circuits, Foundations of Computer Science (FOCS), 2014 IEEE 55th Annual Symposium on, pp.364-373, 2014.

M. Kumar and S. Saraf, The limits of depth reduction for arithmetic formulas, Proceedings of the 46th Annual ACM Symposium on Theory of Computing, STOC '14, pp.136-145, 2014.
DOI : 10.1145/2591796.2591827

J. M. Landsberg and Z. Teitler, On the Ranks and Border Ranks of Symmetric Tensors, Foundations of Computational Mathematics, vol.54, issue.2, pp.339-366, 2010.
DOI : 10.1007/s10208-009-9055-3

G. G. Lorentz, K. Jetter, and S. D. Riemenschneider, Birkhoff interpolation, volume 19 of Encyclopedia of Mathematics and its Applications, 1984.