Recognition of Ordered Tree-Shellable Boolean Functions Based on OBDDs (Special lssue on Selected Papers from LA Synposium)

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper, we consider the complexity of recognizing ordered tree-shellable Boolean functions when Boolean functions are given as OBDDs. An ordered tree-shellable functon is a positive Boolean function such that the unmber of prime implicants equals the number of paths from the root node to a 1-node in its ordered binary decision tree representation. We show that given an OBDD, it is possible to check within polynomial time if the function is ordered tree-shellable with respect to the variable ordering of the OBDD.

• 社団法人電子情報通信学会の論文
• 2001-01-01

著者

• Takenaga Yasuhiko

  The Aouhor Is With The Department Of Computer Science The University Of Electro-communications

関連論文

• Recognition of Ordered Tree-Shellable Boolean Functions Based on OBDDs (Special lssue on Selected Papers from LA Synposium)

スポンサーリンク