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
基金
俄罗斯基础研究基金会;
关键词
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 条
  • [31] Circuit Complexity and Multiplicative Complexity of Boolean Functions
    Kojevnikov, Arist
    Kulikov, Alexander S.
    PROGRAMS, PROOFS, PROCESSES, 2010, 6158 : 239 - 245
  • [32] Multiplication Complexity Optimization based on Quantified Boolean Formulas
    Zhu, Jun
    Pan, Hongyang
    Chu, Zhufei
    2024 INTERNATIONAL SYMPOSIUM OF ELECTRONICS DESIGN AUTOMATION, ISEDA 2024, 2024, : 332 - 336
  • [33] On a Relation Between the Depth and Complexity of Monotone Boolean Formulas
    Sergeev I.S.
    Journal of Applied and Industrial Mathematics, 2019, 13 (04): : 746 - 752
  • [34] THE COMPLEXITY OF VERY SIMPLE BOOLEAN-FORMULAS WITH APPLICATIONS
    HUNT, HB
    STEARNS, RE
    SIAM JOURNAL ON COMPUTING, 1990, 19 (01) : 44 - 70
  • [35] On the modulo degree complexity of Boolean functions
    Li, Qian
    Sun, Xiaoming
    THEORETICAL COMPUTER SCIENCE, 2020, 818 (818) : 32 - 40
  • [36] On the Modulo Degree Complexity of Boolean Functions
    Li, Qian
    Sun, Xiaoming
    COMPUTING AND COMBINATORICS, COCOON 2017, 2017, 10392 : 384 - 395
  • [37] The Complexity of Boolean Functions in Different Characteristics
    Parikshit Gopalan
    Amir Shpilka
    Shachar Lovett
    computational complexity, 2010, 19 : 235 - 263
  • [38] THE CONJUNCTIVE COMPLEXITY OF QUADRATIC BOOLEAN FUNCTIONS
    LENZ, K
    WEGENER, I
    THEORETICAL COMPUTER SCIENCE, 1991, 81 (02) : 257 - 268
  • [39] On the distribution of the spectral complexity of boolean functions
    Ryazanov, B.V.
    1600, Publ by VSP Int Sci Publ, Zeist, Netherlands (04):
  • [40] On the complexity bounds of restrictions of Boolean functions
    Chashkin, AV
    DOKLADY AKADEMII NAUK, 1996, 348 (05) : 595 - 597