抄録
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 | |
| 出版物ステータス | 出版済み - 1 1 1996 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Software
- Theoretical Computer Science
- Hardware and Architecture
これを引用
On the computational power of binary decision diagram with redundant variables. / Yamada, Tetsuya; Yasuura, Hiroto.
：: Formal Methods in System Design, 巻 8, 番号 1, 01.01.1996, p. 65-89.研究成果: ジャーナルへの寄稿 › 記事
}
TY - JOUR
T1 - On the computational power of binary decision diagram with redundant variables
AU - Yamada, Tetsuya
AU - Yasuura, Hiroto
PY - 1996/1/1
Y1 - 1996/1/1
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 -