On the complexity of balanced Boolean functions

被引：0
|
作者：
Institut für Informatik, Technische Universitat Munchen, D-80290 München, Germany [1 ]
机构：
来源：
Inf. Process. Lett. | / 4卷 / 157-163期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [31] On a generalization complexity measure for Boolean functions
    Franco, L
    Anthony, M
    2004 IEEE INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, VOLS 1-4, PROCEEDINGS, 2004, : 973 - 978
  • [32] On the Complexity of Minimizing Quasicyclic Boolean Functions
    Chukhrov I.P.
    Journal of Applied and Industrial Mathematics, 2018, 12 (03) : 426 - 441
  • [33] Evolutionary Construction of Perfectly Balanced Boolean Functions
    Mariot, Luca
    Picek, Stjepan
    Jakobovic, Domagoj
    Djurasevic, Marko
    Leporati, Alberto
    2022 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2022,
  • [34] On constructions of weightwise perfectly balanced Boolean functions
    Mesnager, Sihem
    Su, Sihong
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2021, 13 (06): : 951 - 979
  • [35] The generalized complexity of linear Boolean functions
    Redkin, Nikolay P.
    DISCRETE MATHEMATICS AND APPLICATIONS, 2020, 30 (01): : 39 - 44
  • [36] Average complexity of symmetric Boolean functions
    Chashkin, A.V.
    Vestnik Moskovskogo Universiteta. Ser. 1 Matematika Mekhanika, 2003, (01): : 16 - 20
  • [37] Recent Results on Balanced Symmetric Boolean Functions
    Gao, Guangpu
    Guo, Yingming
    Zhao, Yaqun
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (09) : 5199 - 5203
  • [38] The complexity of modular decomposition of Boolean functions
    Bioch, JC
    DISCRETE APPLIED MATHEMATICS, 2005, 149 (1-3) : 1 - 13
  • [39] On the parity complexity measures of Boolean functions
    Zhang, Zhiqiang
    Shi, Yaoyun
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (26-28) : 2612 - 2618
  • [40] On constructions of weightwise perfectly balanced Boolean functions
    Sihem Mesnager
    Sihong Su
    Cryptography and Communications, 2021, 13 : 951 - 979
12345