Complexity classifications for different equivalence and audit problems for boolean circuits

被引：6
|
作者：
机构：
[1] Böhler, Elmar
[2] Creignou, Nadia
[3] Galota, Matthias
[4] Reith, Steffen
[5] Schnoor, Henning
[6] Vollmer, Heribert
来源：
| 1600年 / Logical Methods in Computer Science卷 / 08期
关键词：
D O I：
10.2168/LMCS-8(3:27)2012
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] COMPLEXITY CLASSIFICATIONS FOR DIFFERENT EQUIVALENCE AND AUDIT PROBLEMS FOR BOOLEAN CIRCUITS
    Boehler, Elmar
    Creignou, Nadia
    Galota, Matthias
    Reith, Steffen
    Schnoor, Henning
    Vollmer, Heribert
    LOGICAL METHODS IN COMPUTER SCIENCE, 2012, 8 (03)
  • [2] The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates
    Elmar Bohler
    Henning Schnoor
    Theory of Computing Systems, 2007, 41 : 753 - 777
  • [3] The complexity of the descriptiveness of boolean circuits over different sets of gates
    Boehler, Elmar
    Schnoor, Henning
    THEORY OF COMPUTING SYSTEMS, 2007, 41 (04) : 753 - 777
  • [4] ON THE COMPLEXITY OF PLANAR BOOLEAN CIRCUITS
    TURAN, G
    COMPUTATIONAL COMPLEXITY, 1995, 5 (01) : 24 - 42
  • [5] Parallel complexity of random Boolean circuits
    Machta, J.
    DeDeo, S.
    Mertens, S.
    Moore, C.
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2011,
  • [6] THE PARALLEL COMPLEXITY OF PROPAGATION IN BOOLEAN CIRCUITS
    SUBRAMANIAN, A
    INFORMATION AND COMPUTATION, 1995, 117 (02) : 266 - 275
  • [7] THE EQUIVALENCE OF HORN AND NETWORK COMPLEXITY FOR BOOLEAN FUNCTIONS
    ANDERAA, SO
    BORGER, E
    ACTA INFORMATICA, 1981, 15 (03) : 303 - 307
  • [8] COMPLEXITY BASED ON PARTITIONING OF BOOLEAN CIRCUITS AND THEIR RELATION TO MULTIVALUED CIRCUITS
    MARUOKA, A
    IEEE TRANSACTIONS ON COMPUTERS, 1986, 35 (02) : 115 - 123
  • [9] LOWER BOUNDS ON THE AREA COMPLEXITY OF BOOLEAN CIRCUITS
    HROMKOVIC, J
    LOZKIN, SA
    RYBKO, AI
    SAPOZENKO, AA
    SKALIKOVA, NA
    THEORETICAL COMPUTER SCIENCE, 1992, 97 (02) : 285 - 300
  • [10] Boolean circuits, tensor ranks, and communication complexity
    Pudlak, P
    Rodl, V
    Sgall, J
    SIAM JOURNAL ON COMPUTING, 1997, 26 (03) : 605 - 633
12345