On the computational power of binary decision diagram with redundant variables

Tetsuya Yamada; Hiroto Yasuura

doi:10.1007/BF00121263

On the computational power of binary decision diagram with redundant variables

Tetsuya Yamada, Hiroto Yasuura

総長・役員等

研究成果: ジャーナルへの寄稿 › 学術誌 › 査読

1 被引用数 (Scopus)

抄録

We introduce a BDD with redundant variables as an Indexed BDD (IBDD) and define PolyIBDD as the class of Boolean functions represented by polynomial-sized IBDDs for the number of input variables. Assuming that the class of languages on {0, 1}* that are accepted by logarithmic space bounded DTMs is DLOG, the following relation holds. PolyIBDD = DLOG. That is to say that languages which belong to DLOG also belong to PolyIBDD. We also show examples of polynomial-sized IBDD's construction from logarithmic space bounded DTMs.

本文言語	英語
ページ（範囲）	65-89
ページ数	25
ジャーナル	Formal Methods in System Design
巻	8
号	1
DOI	https://doi.org/10.1007/BF00121263
出版ステータス	出版済み - 1996

!!!All Science Journal Classification (ASJC) codes

ソフトウェア
理論的コンピュータサイエンス
ハードウェアとアーキテクチャ

文献へのアクセス

10.1007/BF00121263

他のファイルとリンク

引用スタイル

@article{793931803c9e483582f496935235bd7d,

title = "On the computational power of binary decision diagram with redundant variables",

abstract = "We introduce a BDD with redundant variables as an Indexed BDD (IBDD) and define PolyIBDD as the class of Boolean functions represented by polynomial-sized IBDDs for the number of input variables. Assuming that the class of languages on {0, 1}* that are accepted by logarithmic space bounded DTMs is DLOG, the following relation holds. PolyIBDD = DLOG. That is to say that languages which belong to DLOG also belong to PolyIBDD. We also show examples of polynomial-sized IBDD's construction from logarithmic space bounded DTMs.",

author = "Tetsuya Yamada and Hiroto Yasuura",

year = "1996",

doi = "10.1007/BF00121263",

language = "English",

volume = "8",

pages = "65--89",

journal = "Formal Methods in System Design",

issn = "0925-9856",

publisher = "Springer Netherlands",

number = "1",

}

TY - JOUR

T1 - On the computational power of binary decision diagram with redundant variables

AU - Yamada, Tetsuya

AU - Yasuura, Hiroto

PY - 1996

Y1 - 1996

N2 - We introduce a BDD with redundant variables as an Indexed BDD (IBDD) and define PolyIBDD as the class of Boolean functions represented by polynomial-sized IBDDs for the number of input variables. Assuming that the class of languages on {0, 1}* that are accepted by logarithmic space bounded DTMs is DLOG, the following relation holds. PolyIBDD = DLOG. That is to say that languages which belong to DLOG also belong to PolyIBDD. We also show examples of polynomial-sized IBDD's construction from logarithmic space bounded DTMs.

AB - We introduce a BDD with redundant variables as an Indexed BDD (IBDD) and define PolyIBDD as the class of Boolean functions represented by polynomial-sized IBDDs for the number of input variables. Assuming that the class of languages on {0, 1}* that are accepted by logarithmic space bounded DTMs is DLOG, the following relation holds. PolyIBDD = DLOG. That is to say that languages which belong to DLOG also belong to PolyIBDD. We also show examples of polynomial-sized IBDD's construction from logarithmic space bounded DTMs.

UR - http://www.scopus.com/inward/record.url?scp=0029754816&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029754816&partnerID=8YFLogxK

U2 - 10.1007/BF00121263

DO - 10.1007/BF00121263

M3 - Article

AN - SCOPUS:0029754816

VL - 8

SP - 65

EP - 89

JO - Formal Methods in System Design

JF - Formal Methods in System Design

SN - 0925-9856

IS - 1

ER -

On the computational power of binary decision diagram with redundant variables

抄録

!!!All Science Journal Classification (ASJC) codes

文献へのアクセス

他のファイルとリンク

フィンガープリント

引用スタイル