Circuit Complexity and Multiplicative Complexity of Boolean Functions

被引：0
|
作者：
Kojevnikov, Arist [1 ]
Kulikov, Alexander S. [1 ]
机构：
[1] VA Steklov Math Inst, St Petersburg Dept, Moscow 117333, Russia
来源：
PROGRAMS, PROOFS, PROCESSES | 2010年 / 6158卷
关键词：
COMBINATIONAL COMPLEXITY; BOUNDS;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 - c lower bound on the circuit complexity of a large class of functions representable by high degree polynomials over GF(2). The key idea of the proof is a circuit complexity measure assigning different weights to XOR and AND gates.
引用
收藏
页码：239 / 245
页数：7
相关论文
共 50 条
  • [41] The Complexity of Boolean Functions in Different Characteristics
    Parikshit Gopalan
    Amir Shpilka
    Shachar Lovett
    computational complexity, 2010, 19 : 235 - 263
  • [42] THE CONJUNCTIVE COMPLEXITY OF QUADRATIC BOOLEAN FUNCTIONS
    LENZ, K
    WEGENER, I
    THEORETICAL COMPUTER SCIENCE, 1991, 81 (02) : 257 - 268
  • [43] On the distribution of the spectral complexity of boolean functions
    Ryazanov, B.V.
    1600, Publ by VSP Int Sci Publ, Zeist, Netherlands (04):
  • [44] On the complexity bounds of restrictions of Boolean functions
    Chashkin, AV
    DOKLADY AKADEMII NAUK, 1996, 348 (05) : 595 - 597
  • [45] On the Complexity of Boolean Functions in Different Characteristics
    Gopalan, Parikshit
    Lovett, Shachar
    Shpilka, Amir
    PROCEEDINGS OF THE 24TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, 2009, : 173 - +
  • [46] RESEARCHING THE COMPLEXITY OF BOOLEAN FUNCTIONS WITH COMPUTERS
    Toran, Jacobo
    Amano, Kazuyuki
    BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2010, (101): : 64 - 91
  • [47] Complexity of decision trees for boolean functions
    Freivalds, R
    Miyakawa, M
    Rosenberg, IG
    33RD INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC, PROCEEDINGS, 2003, : 253 - 255
  • [48] Query complexity of Boolean functions on slices
    Byramji, Farzan
    DISCRETE MATHEMATICS, 2024, 347 (06)
  • [49] On a generalization complexity measure for Boolean functions
    Franco, L
    Anthony, M
    2004 IEEE INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, VOLS 1-4, PROCEEDINGS, 2004, : 973 - 978
  • [50] On the Complexity of Minimizing Quasicyclic Boolean Functions
    Chukhrov I.P.
    Journal of Applied and Industrial Mathematics, 2018, 12 (03) : 426 - 441
12345