Art

J-GLOBAL ID：200902178157788049   Reference number：93A0464220

An Introduction to Binary Decision Diagrams.

BDD(二分決定グラフ) 1.BDDとは

Author (1)： ISHIURA NAGISA (大阪大 工)
Material： 情報処理  (IPSJ Magazine)
Volume： 34  Issue： 5  Page： 585-592  Publication year： May. 1993 
JST Material Number： G0427A  ISSN： 0447-8053  Document type： Article
Article type： 文献レビュー  Country of issue： Japan (JPN)  Language： JAPANESE (JA)

Thesaurus term： logical function ,...
Semi thesaurus term： computational complexity

   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=93A0464220&from=J-GLOBAL&jstjournalNo=G0427A") }}

JST classification (3)： CAD,CAM  (JE10000A) ,  Logic circuits  (NC05070B) ,  Theory of computation  (JB02000A)

Reference (31)：

• AKERS, S. B. Binary Decision Diagrams. IEEE Trans. Comput. 1978, C-27, 6, 509-516
• BRECE, K. S. Efficient Implementation of a BDD Package. Proc. 27th ACM/IEEE Design Automation Conf. 1990, 40-45
• BRYANT, R. E. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Trans. Comput. 1986, C-35, 8, 677-691
• BRYANT, R. E. On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication. IEEE Trans. Comput. 1991, C-40, 2, 205-213
• BURCH, J. R. Sequential Circuit Verfication Using Symbolic Model Checking. Proc. 27th ACM/IEEE Design Automation Conf. 1990, 46-51

Terms in the title (2)： BDD ,  二分決定グラフ