arXiv:1710.09502v1 [cs.CC] 26 Oct 2017 ∗ 1 † ‡ § irsf eerhNwEgad mi:[email protected] email: England, New Research [email protected]. Microsoft email: University, Gurion Ben eateto optrSine nvriyo oot,ema Toronto, of University Science, Computer of Department nttt o dacdSuy rneo,eal avi@math. email: Princeton, Study, Advanced for Institute eyrsrce omo et- circuits depth-3 of form restricted very A ewe the between oyoilfrualwrbounds. lower formula polynomial h onsaoeaeafrcy(udaial wy rmtetrue the from away) which method e (quadratically models, rank best cry these the far the in why a match polynomials) explanations are nearly an above above offer bounds bounds the hence the models, these First, for following. the note arithm other for barriers to halted. extended has be perhaps can techniques mtyfrpoigtno akadsmerctno aklwrb particular, lower In rank tensor methods. symmetric these and to rank barriers tensor proving for ometry ucse.Rn ehd udrtenm of name the (under methods includin Rank to-date, bounds successes. lower arithmetic qu known study. all similar this almost stracting of to add excuses b to no lower Bo aims have arithmetic in paper we to This bounds attempts complexity. barriers lower some arithmetic find basic despite to prove and Efforts to harder, failing complexity. for arithmetic results” in “barrier of for form remain tensors, size 3-dimensional formula explicit or on circuit bounds on lower however super-linear bounds progress, lower rapid super-polynomial and co proving arithmetic successes in many results Despite and complexity. techniques bound lower more significantly utpiain,i osdrd(o aygo esn)smlrt und to simpler reasons) good many (for considered is multiplications, complexity lmEfremenko Klim • • h roso hs onsuesml ieragbacarguments, linear-algebraic simple use bounds these of proofs The rtmtccomplexity Arithmetic osehwteebrirrslsdrcl nomtestate-of-art the inform directly results barrier these how see To nti ae eaddress we paper this In mo plenty have we reasons), similar for possibly (and time same the At aresfrRn ehd nAihei Complexity Arithmetic in Methods Rank for Barriers fdegree of akmethods Rank nldn et- circuits.) depth-3 including akmethods Rank d > dmninltno fside of tensor -dimensional 8 n aeycmuigBoenfntosvalgclgts n ned w indeed, And gates. logical via functions Boolean computing namely , esrrn oe onsfor bounds lower rank tensor symbolic d I atclr hycno rv uhlwrbud nstronge on bounds lower such prove cannot they particular, (In . cannot cannot ako arxplnmasadteuulrn ftereautos T evaluations. their of rank usual the and polynomials matrix of rank ∗ h td ftecs fcmuigplnmasvaadtosand additions via polynomials computing of cost the of study the , rv etrta Ω than better prove rv Ω prove akmethods rank ni Garg Ankit n I atclr hycno rv ue-ier nedeven indeed super-linear, prove cannot they particular, (In . d ( if coe 7 2017 27, October n ⌊ civd(yaymtos,aekont ml super- imply to known are methods), any (by achieved d/ any hc eeln eonzda nopsigadab- and encompassing as recognized long were which , 2 Abstract † ⌋ nthe on ) -iesoa tensors.) 3-dimensional flattenings 1 d ( aalOliveira Rafael n ⌊ d/ ias.edu. om. aigrank Waring 2 ⌋ l [email protected]. il: oe on ntetno akof rank tensor the on bound lower ) r loi ieuei leri ge- algebraic in use wide in also are ) tcmdl nwihprogress which on models etic onainlcalne,like challenges, foundational , 1 ud.Ormi eut are results main Our ounds. naihei opeiywe complexity arithmetic in h otrcn impressive recent most the g fany of opeiy(..o random of (e.g. complexity ‡ elusive. o tc hr.Second, there. stuck got s peiyta nBoolean in than mplexity lt o hs alrsin failures these for ality pii onsw know we bounds xplicit xlctplnmas or polynomials, explicit eeaigconnections leveraging la opeiythan complexity olean udtcnqe seem techniques ound rtn than erstand n v Wigderson Avi vraepolynomial -variate eecss nthe in excuses, re emt have to seem e models, r Boolean hese any § We also explain the relation of our barrier