THE MULTIPLICATIVE COMPLEXITY OF BOOLEAN FUNCTIONS

被引：0
作者：
SCHNORR, CP
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1989年 / 357卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：45 / 58
页数：14
相关论文
共 50 条
[21]   Computational complexity of Boolean functions [J].
Korshunov, A. D. .
RUSSIAN MATHEMATICAL SURVEYS, 2012, 67 (01) :93-165
[22]   On cryptographic complexity of Boolean functions [J].
Carlet, C .
FINITE FIELDS WITH APPLICATIONS TO CODING THEORY, CRYPTOGRAPHY AND RELATED AREAS, 2002, :53-69
[23]   On the complexity of balanced Boolean functions [J].
Bernasconi, A .
ALGORITHMS AND COMPLEXITY, 1997, 1203 :253-263
[24]   On the complexity of balanced Boolean functions [J].
Bernasconi, A .
INFORMATION PROCESSING LETTERS, 1999, 70 (04) :157-163
[25]   COMPLEXITY OF MONOTONE BOOLEAN FUNCTIONS [J].
PIPPENGER, N .
MATHEMATICAL SYSTEMS THEORY, 1978, 11 (04) :289-316
[26]   THE VLSI COMPLEXITY OF BOOLEAN FUNCTIONS [J].
KRAMER, MR ;
VANLEEUWEN, J .
LECTURE NOTES IN COMPUTER SCIENCE, 1984, 171 :397-407
[27]   Local complexity of Boolean functions [J].
Chashkin, A .
DISCRETE APPLIED MATHEMATICS, 2004, 135 (1-3) :55-64
[28]   COMPOSITIONAL COMPLEXITY OF BOOLEAN FUNCTIONS [J].
ABELSON, H ;
EHRENFEUCHT, A ;
FICKETT, J ;
MYCIELSKI, J .
DISCRETE APPLIED MATHEMATICS, 1982, 4 (01) :1-10
[29]   COMPLEXITY HIERARCHIES FOR BOOLEAN FUNCTIONS [J].
MCCOLL, WF .
ACTA INFORMATICA, 1978, 11 (01) :71-77
[30]   MULTIPLICATIVE COMPLEXITY OF SOME RATIONAL FUNCTIONS [J].
HARTMANN, W ;
SCHUSTER, P .
THEORETICAL COMPUTER SCIENCE, 1980, 10 (01) :53-61
12345