ON SOME CHARACTERISTICS OF BOOLEAN FUNCTION MINIMIZATION ALGORITHMS

被引：0
|
作者：
AN, NK
机构：
来源：
DOKLADY AKADEMII NAUK SSSR | 1982年 / 267卷 / 05期
关键词：
D O I：
暂无
中图分类号：
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号：
07 ; 0710 ; 09 ;
摘要：
引用
收藏
页码：1058 / 1062
页数：5
相关论文
共 50 条
  • [31] MINIMIZATION OF BOOLEAN FUNCTIONS
    BISWAS, NN
    IEEE TRANSACTIONS ON COMPUTERS, 1971, C 20 (08) : 925 - &
  • [32] MINIMIZATION OF BOOLEAN FUNCTIONS
    MCCLUSKEY, EJ
    BELL SYSTEM TECHNICAL JOURNAL, 1956, 35 (06): : 1417 - 1444
  • [33] Geometric Rescaling Algorithms for Submodular Function Minimization
    Dadush, Daniel
    Vegh, Laszlo A.
    Zambelli, Giacomo
    SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 832 - 848
  • [34] MINIMIZATION OF BOOLEAN RELATIONS
    BRAYTON, RK
    SOMENZI, F
    1989 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-3, 1989, : 738 - 743
  • [35] Geometric Rescaling Algorithms for Submodular Function Minimization
    Dadush, Dan
    Vegh, Laszlo A.
    Zambelli, Giacomo
    MATHEMATICS OF OPERATIONS RESEARCH, 2021, 46 (03) : 1081 - 1108
  • [36] ALGORITHMS FOR WRITING A BOOLEAN FUNCTION INCREMENTING IN SUMS AND PRODUCTS
    CHEIN, M
    REVUE FRANCAISE D INFORMATIQUE DE RECHERCHE OPERATIONNELLE, 1967, 1 (06): : 97 - &
  • [37] On PAC learning algorithms for rich boolean function classes
    Servedio, Rocco A.
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2006, 3959 : 442 - 451
  • [38] GRAPH-BASED ALGORITHMS FOR BOOLEAN FUNCTION MANIPULATION
    BRYANT, RE
    IEEE TRANSACTIONS ON COMPUTERS, 1986, 35 (08) : 677 - 691
  • [39] ALGORITHMS FOR COMPUTING CRYPTOGRAPHIC CHARACTERISTICS OF VECTORIAL BOOLEAN FUNCTIONS
    Kiseleva, N. M.
    Lipatova, E. S.
    Pankratova, I. A.
    Trifonova, E. E.
    PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2019, (46): : 78 - 87
  • [40] On PAC learning algorithms for rich Boolean function classes
    Hellerstein, Lisa
    Servedio, Rocco A.
    THEORETICAL COMPUTER SCIENCE, 2007, 384 (01) : 66 - 76
12345