THE VLSI COMPLEXITY OF BOOLEAN FUNCTIONS

被引：0

|

作者：

KRAMER, MR

VANLEEUWEN, J

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1984年 / 171卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：397 / 407

页数：11

相关论文

共 50 条

[1] ON THE COMPLEXITY OF VLSI IMPLEMENTATIONS AND GRAPH REPRESENTATIONS OF BOOLEAN FUNCTIONS WITH APPLICATION TO INTEGER MULTIPLICATION
BRYANT, RE
IEEE TRANSACTIONS ON COMPUTERS, 1991, 40 (02) : 205 - 213
[2] 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):
[3] On the Multiplicative Complexity of Boolean Functions
Selezneva, Svetlana N.
FUNDAMENTA INFORMATICAE, 2016, 145 (03) : 399 - 404
[4] THE COMPLEXITY OF SYMMETRICAL BOOLEAN FUNCTIONS
WEGENER, I
LECTURE NOTES IN COMPUTER SCIENCE, 1987, 270 : 433 - 442
[5] Computational complexity of Boolean functions
Korshunov, A. D.
RUSSIAN MATHEMATICAL SURVEYS, 2012, 67 (01) : 93 - 165
[6] THE MULTIPLICATIVE COMPLEXITY OF BOOLEAN FUNCTIONS
SCHNORR, CP
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 357 : 45 - 58
[7] On cryptographic complexity of Boolean functions
Carlet, C
FINITE FIELDS WITH APPLICATIONS TO CODING THEORY, CRYPTOGRAPHY AND RELATED AREAS, 2002, : 53 - 69
[8] On the complexity of balanced Boolean functions
Bernasconi, A
ALGORITHMS AND COMPLEXITY, 1997, 1203 : 253 - 263
[9] On the complexity of balanced Boolean functions
Bernasconi, A
INFORMATION PROCESSING LETTERS, 1999, 70 (04) : 157 - 163
[10] COMPLEXITY OF MONOTONE BOOLEAN FUNCTIONS
PIPPENGER, N
MATHEMATICAL SYSTEMS THEORY, 1978, 11 (04): : 289 - 316

← 1 2 3 4 5 →