Yasuhiko TAKENAGA


Tree-Shellability of Restricted DNFs
Yasuhiko TAKENAGA Nao KATOUGI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2008/04/01
Vol. E91-D  No. 4  pp. 996-1002
Type of Manuscript:  PAPER
Category: Algorithm Theory
Keyword: 
Boolean functionshellabilityprime implicantbinary decision tree
 Summary | Full Text:PDF(210.9KB)

FOREWORD
Tetsuro NISHINO Yasuhiko TAKENAGA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2005/01/01
Vol. E88-D  No. 1  pp. 10-11
Type of Manuscript:  FOREWORD
Category: 
Keyword: 
 Summary | Full Text:PDF(69.8KB)

Recognition of Ordered Tree-Shellable Boolean Functions Based on OBDDs
Yasuhiko TAKENAGA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2001/01/01
Vol. E84-D  No. 1  pp. 28-33
Type of Manuscript:  Special Section PAPER (Special Issue on Selected Papers from LA Symposium)
Category: 
Keyword: 
tree-shellable Boolean functionordered binary decision diagram (OBDD)prime implicantshellability
 Summary | Full Text:PDF(253.3KB)

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 complexityBoolean functionordered binary decision diagramsatisfiabilitycombinational circuitcutwidthsum-of-product formzero-suppressed binary decision diagrams (BDD)ternary decision diagram
 Summary | Full Text:PDF(675.4KB)

Computational Complexity of Manipulating Binary Decision Diagrams
Yasuhiko TAKENAGA Shuzo YAJIMA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1994/06/25
Vol. E77-D  No. 6  pp. 642-647
Type of Manuscript:  PAPER
Category: Algorithm and Computational Complexity
Keyword: 
binary decision diagramcomputatioal complexityBoolean functionparallel algorithm
 Summary | Full Text:PDF(554.8KB)

On the Computational Power of Binary Decision Diagrams
Hiroshi SAWADA Yasuhiko TAKENAGA Shuzo YAJIMA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1994/06/25
Vol. E77-D  No. 6  pp. 611-618
Type of Manuscript:  PAPER
Category: Automata, Languages and Theory of Computing
Keyword: 
binary decision diagramon-line Turing machineplaner circuitpermutationcomplete language
 Summary | Full Text:PDF(640.9KB)

Computational Power of Memory-Based Parallel Computation Models with Communication
Yasuhiko TAKENAGA Shuzo YAJIMA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1992/01/25
Vol. E75-D  No. 1  pp. 89-94
Type of Manuscript:  Special Section PAPER (Special Section on Theoretical Foundations of Computing)
Category: 
Keyword: 
parallel computation modelcomputational powerhypercube networkfunctional memorymemory-based parallel computation
 Summary | Full Text:PDF(534.5KB)