Lower bounds on arithmetic circuits via partial derivatives

被引：0
|
作者：
Nisan, N [1 ]
Wigderson, A
机构：
[1] Hebrew Univ Jerusalem, Inst Comp Sci, IL-91905 Jerusalem, Israel
[2] Aarhus Univ, BRICS, DK-8000 Aarhus C, Denmark
来源：
COMPUTATIONAL COMPLEXITY | 1997年 / 6卷 / 03期
关键词：
circuit complexity; arithmetic circuits; lower bounds; iterated matrix product;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper we describe a new technique for obtaining lower bounds on restricted classes of non-monotone arithmetic circuits. The heart of this technique is a complexity measure for multivariate polynomials, based on the linear span of their partial derivatives. We use the technique to obtain new lower bounds for computing symmetric polynomials (that hold over fields of characteristic zero) and iterated matrix products (that hold for all fields).
引用
收藏
页码：217 / 234
页数：18
相关论文
共 50 条
  • [1] Lower Bounds for Arithmetic Circuits via the Hankel Matrix
    Fijalkow, Nathanael
    Lagarde, Guillaume
    Ohlmann, Pierre
    Serre, Olivier
    COMPUTATIONAL COMPLEXITY, 2021, 30 (02)
  • [2] Lower Bounds for Arithmetic Circuits via the Hankel Matrix
    Fijalkow, Nathanael
    Lagarde, Guillaume
    Ohlmann, Pierre
    Serre, Olivier
    37TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2020), 2020, 154
  • [3] Lower Bounds for Arithmetic Circuits via the Hankel Matrix
    Nathanaël Fijalkow
    Guillaume Lagarde
    Pierre Ohlmann
    Olivier Serre
    computational complexity, 2021, 30
  • [4] Learning arithmetic circuits via partial derivatives
    Klivans, AR
    Shpilka, A
    LEARNING THEORY AND KERNEL MACHINES, 2003, 2777 : 463 - 476
  • [5] Lower Bounds for Monotone Arithmetic Circuits via Communication Complexity
    Chattopadhyay, Arkadev
    Datta, Rajit
    Mukhopadhyay, Partha
    STOC '21: PROCEEDINGS OF THE 53RD ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2021, : 786 - 799
  • [6] Lower Bounds for Planar Arithmetic Circuits
    Ramya, C.
    Shastri, Pratik
    15TH INNOVATIONS IN THEORETICAL COMPUTER SCIENCE CONFERENCE, ITCS 2024, 2024,
  • [7] On Lower Bounds for Constant Width Arithmetic Circuits
    Arvind, V.
    Joglekar, Pushkar S.
    Srinivasan, Srikanth
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 637 - 646
  • [8] Recent progress on lower bounds for arithmetic circuits
    Saraf, Shubhangi
    2014 IEEE 29TH CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC), 2014, : 155 - 160
  • [9] Elusive Functions and Lower Bounds for Arithmetic Circuits
    Raz, Ran
    STOC'08: PROCEEDINGS OF THE 2008 ACM INTERNATIONAL SYMPOSIUM ON THEORY OF COMPUTING, 2008, : 711 - 720
  • [10] Elusive Functions and Lower Bounds for Arithmetic Circuits
    Raz, Ran
    Theory of Computing, 2010, 6 : 135 - 177
12345