Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams

被引：0
|
作者：
FB Informatik, LS II, Universität Dortmund, 44221 Dortmund, Germany [1 ]
机构：
来源：
Theory Comput. Syst. | / 4卷 / 487-503期
关键词：
Number:; We; 1066/8; Acronym:; DFG; Sponsor: Deutsche Forschungsgemeinschaft;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [21] ON THE COMPUTATIONAL POWER OF BINARY DECISION DIAGRAMS
    SAWADA, H
    TAKENAGA, Y
    YAJIMA, S
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1994, E77D (06) : 611 - 618
  • [22] Binary decision diagrams on network of workstations
    Ranjan, RK
    Sanghavi, JV
    Brayton, RK
    SangiovanniVincentelli, A
    INTERNATIONAL CONFERENCE ON COMPUTER DESIGN - VLSI IN COMPUTERS AND PROCESSORS, PROCEEDINGS, 1996, : 358 - 364
  • [23] Factorization using binary decision diagrams
    Raddum, Havard
    Varadharajan, Srimathi
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2019, 11 (03): : 443 - 460
  • [24] Binary Decision Diagrams and neural networks
    P. W. C. Prasad
    Ali Assi
    Azam Beg
    The Journal of Supercomputing, 2007, 39 : 301 - 320
  • [25] Binary superposed quantum decision diagrams
    David Rosenbaum
    Quantum Information Processing, 2010, 9 : 463 - 496
  • [26] Approximation and decomposition of binary decision diagrams
    Ravi, K
    McMillan, KL
    Shiple, TR
    Somenzi, F
    1998 DESIGN AUTOMATION CONFERENCE, PROCEEDINGS, 1998, : 445 - 450
  • [27] SYNTHESIS FOR TESTABILITY - BINARY DECISION DIAGRAMS
    BECKER, B
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 577 : 501 - 512
  • [28] FUNCTIONAL TESTING WITH BINARY DECISION DIAGRAMS
    AKERS, SB
    JOURNAL OF DESIGN AUTOMATION & FAULT-TOLERANT COMPUTING, 1978, 2 (04): : 311 - 331
  • [29] A CHARACTERIZATION OF BINARY DECISION DIAGRAMS - COMMENT
    WEGENER, I
    IEEE TRANSACTIONS ON COMPUTERS, 1994, 43 (03) : 383 - 384
  • [30] Factorization using binary decision diagrams
    Håvard Raddum
    Srimathi Varadharajan
    Cryptography and Communications, 2019, 11 : 443 - 460
12345