A lower bound for the size of syntactically multilinear arithmetic circuits

被引：7
|
作者：
Raz, Ran [1 ]
Shpilka, Amir [2 ]
Yehudayoff, Amir [1 ]
机构：
[1] Weizmann Inst Sci, Fac Math & Comp Sci, IL-76100 Rehovot, Israel
[2] Technion Israel Inst Technol, Fac Comp Sci, Haifa, Israel
来源：
48TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS | 2007年
基金：
以色列科学基金会;
关键词：
D O I：
10.1109/FOCS.2007.13
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We construct an explicit polynomial f (x(1),..., x(n)), with coefficients in f 0, 11, such that the size of any syntactically multilinear arithmetic circuit computing f is at least Omega(n(4/3)/log(2)n). The lower bound holds over anyfield.
引用
收藏
页码：438 / +
页数：2
相关论文
共 50 条
  • [1] A LOWER BOUND FOR THE SIZE OF SYNTACTICALLY MULTILINEAR ARITHMETIC CIRCUITS
    Raz, Ran
    Shpilka, Amir
    Yehudayoff, Amir
    [J]. SIAM JOURNAL ON COMPUTING, 2008, 38 (04) : 1624 - 1647
  • [2] Unbalancing Sets and An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits
    Alon, Noga
    Kumar, Mrinal
    Volk, Ben Lee
    [J]. COMBINATORICA, 2020, 40 (02) : 149 - 178
  • [3] Unbalancing Sets and an Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits
    Alon, Noga
    Kumar, Mrinal
    Volk, Ben Lee
    [J]. 33RD COMPUTATIONAL COMPLEXITY CONFERENCE (CCC 2018), 2018, 102
  • [4] Unbalancing Sets and An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits
    Noga Alon
    Mrinal Kumar
    Ben Lee Volk
    [J]. Combinatorica, 2020, 40 : 149 - 178
  • [5] BALANCING SYNTACTICALLY MULTILINEAR ARITHMETIC CIRCUITS
    Raz, Ran
    Yehudayoff, Amir
    [J]. COMPUTATIONAL COMPLEXITY, 2008, 17 (04) : 515 - 535
  • [6] Balancing Syntactically Multilinear Arithmetic Circuits
    Ran Raz
    Amir Yehudayoff
    [J]. computational complexity, 2008, 17 : 515 - 535
  • [7] Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits
    Maurice Jansen
    Meena Mahajan
    B. V. Raghavendra Rao
    [J]. computational complexity, 2013, 22 : 517 - 564
  • [8] Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits
    Jansen, Maurice
    Mahajan, Meena
    Rao, B. V. Raghavendra
    [J]. COMPUTATIONAL COMPLEXITY, 2013, 22 (03) : 517 - 564
  • [9] Lower bounds for syntactically multilinear algebraic branching programs
    Jansen, Maurice J.
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2008, PROCEEDINGS, 2008, 5162 : 407 - 418
  • [10] An exponential lower bound for the size of monotone real circuits
    Haken, A
    Cook, SA
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1999, 58 (02) : 326 - 335
12345