| Kazuyoshi TAKAGI
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Computational Power of Nondeterministic Ordered Binary Decision Diagrams and Their Subclasses Kazuyoshi TAKAGI Koyo NITTA Hironori BOUNO Yasuhiko TAKENAGA Shuzo YAJIMA | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1997/04/25
Vol. E80-A
No. 4
pp. 663-669
Type of Manuscript:
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: computational complexity, Boolean function, ordered binary decision diagram, satisfiability, combinational circuit, cutwidth, sum-of-product form, zero-suppressed binary decision diagrams (BDD), ternary decision diagram, | | Summary | Full Text:PDF(675.4KB) | |
|
|