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 条

[21] THE MULTIPLICATIVE COMPLEXITY OF QUADRATIC BOOLEAN FORMS
MIRWALD, R
SCHNORR, CP
THEORETICAL COMPUTER SCIENCE, 1992, 102 (02) : 307 - 328
[22] On the Multiplicative Complexity of Boolean Functions and Bitsliced Higher-Order Masking
Goudarzi, Dahmun
Rivain, Matthieu
CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS - CHES 2016, 2016, 9813 : 457 - 478
[23] New upper bounds on the Boolean circuit complexity of symmetric functions
Demenkov, E.
Kojevnikov, A.
Kulikov, A.
Yaroslavtsev, G.
INFORMATION PROCESSING LETTERS, 2010, 110 (07) : 264 - 267
[24] Patterns and complexity of multiplicative functions
Buttkewitz, Y.
Elsholtz, C.
JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 2011, 84 : 578 - 594
[25] On the complexity of balanced Boolean functions
Institut für Informatik, Technische Universitat Munchen, D-80290 München, Germany
Inf. Process. Lett., 4 (157-163):
[26] THE COMPLEXITY OF SYMMETRICAL BOOLEAN FUNCTIONS
WEGENER, I
LECTURE NOTES IN COMPUTER SCIENCE, 1987, 270 : 433 - 442
[27] Computational complexity of Boolean functions
Korshunov, A. D.
RUSSIAN MATHEMATICAL SURVEYS, 2012, 67 (01) : 93 - 165
[28] On cryptographic complexity of Boolean functions
Carlet, C
FINITE FIELDS WITH APPLICATIONS TO CODING THEORY, CRYPTOGRAPHY AND RELATED AREAS, 2002, : 53 - 69
[29] On the complexity of balanced Boolean functions
Bernasconi, A
ALGORITHMS AND COMPLEXITY, 1997, 1203 : 253 - 263
[30] On the complexity of balanced Boolean functions
Bernasconi, A
INFORMATION PROCESSING LETTERS, 1999, 70 (04) : 157 - 163

← 1 2 3 4 5 →