Complexity of Implementation of Boolean Functions by Real Formulas

被引：2

作者：

Gashkov, S. B. ^{[1
]}

Vegner, Ya. V. ^{[1
]}

机构：

[1] Moscow MV Lomonosov State Univ, Fac Mech & Math, Moscow 119991, Russia

来源：

MOSCOW UNIVERSITY MATHEMATICS BULLETIN | 2008年 / 63卷 / 02期

基金：

俄罗斯基础研究基金会;

关键词：

D O I：

10.3103/S0027132208020083

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Upper complexity estimates are proved for implementation of Boolean functions by formulas in bases consisting of a finite number of continuous real functions and a continuum of constants. For some bases upper complexity estimates coincide with lower ones.

引用

页码：76 / 78

页数：3

共 50 条

[21] Computational complexity of Boolean functions
Korshunov, A. D.
RUSSIAN MATHEMATICAL SURVEYS, 2012, 67 (01) : 93 - 165
[22] THE MULTIPLICATIVE COMPLEXITY OF BOOLEAN FUNCTIONS
SCHNORR, CP
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 357 : 45 - 58
[23] On cryptographic complexity of Boolean functions
Carlet, C
FINITE FIELDS WITH APPLICATIONS TO CODING THEORY, CRYPTOGRAPHY AND RELATED AREAS, 2002, : 53 - 69
[24] On the complexity of balanced Boolean functions
Bernasconi, A
ALGORITHMS AND COMPLEXITY, 1997, 1203 : 253 - 263
[25] On the complexity of balanced Boolean functions
Bernasconi, A
INFORMATION PROCESSING LETTERS, 1999, 70 (04) : 157 - 163
[26] THE VLSI COMPLEXITY OF BOOLEAN FUNCTIONS
KRAMER, MR
VANLEEUWEN, J
LECTURE NOTES IN COMPUTER SCIENCE, 1984, 171 : 397 - 407
[27] COMPLEXITY OF MONOTONE BOOLEAN FUNCTIONS
PIPPENGER, N
MATHEMATICAL SYSTEMS THEORY, 1978, 11 (04): : 289 - 316
[28] Local complexity of Boolean functions
Chashkin, A
DISCRETE APPLIED MATHEMATICS, 2004, 135 (1-3) : 55 - 64
[29] COMPOSITIONAL COMPLEXITY OF BOOLEAN FUNCTIONS
ABELSON, H
EHRENFEUCHT, A
FICKETT, J
MYCIELSKI, J
DISCRETE APPLIED MATHEMATICS, 1982, 4 (01) : 1 - 10
[30] COMPLEXITY HIERARCHIES FOR BOOLEAN FUNCTIONS
MCCOLL, WF
ACTA INFORMATICA, 1978, 11 (01) : 71 - 77

← 1 2 3 4 5 →