Presentation 2006-03-23
Recognition of Tree-Shellable Boolean Functions with Several Restrictions
Nao KATOUGI, Yasuhiko TAKENAGA, Takashi ISHIBASHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A tree-shellable function is a positive Boolean function which can be represented by a binary decision tree whose number of paths from the root to a leaf labeled 1 equals the number of prime implicants. In this paper, we show that it is NP-complete to check the ordered tree-shellability even if the maximum number of literals in a term is 4. We also consider the property of tree-shellable funcitons when the number of the same literal in the DNF is restricted.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) tree-shellability / Boolean function / binary decision tree / prime implicant
Paper # COMP2005-67
Date of Issue

Conference Information
Committee COMP
Conference Date 2006/3/16(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Recognition of Tree-Shellable Boolean Functions with Several Restrictions
Sub Title (in English)
Keyword(1) tree-shellability
Keyword(2) Boolean function
Keyword(3) binary decision tree
Keyword(4) prime implicant
1st Author's Name Nao KATOUGI
1st Author's Affiliation Department of Computer Science, Graduate School of Electro-Communications, The University of Electro-Communications()
2nd Author's Name Yasuhiko TAKENAGA
2nd Author's Affiliation Department of Computer Science, Faculty of Electro-Communications, The University of Electro-Communications
3rd Author's Name Takashi ISHIBASHI
3rd Author's Affiliation Department of Computer Science, Faculty of Electro-Communications, The University of Electro-Communications
Date 2006-03-23
Paper # COMP2005-67
Volume (vol) vol.105
Number (no) 680
Page pp.pp.-
#Pages 7
Date of Issue