### 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.

Original language | English |
---|---|

Pages (from-to) | 65-89 |

Number of pages | 25 |

Journal | Formal Methods in System Design |

Volume | 8 |

Issue number | 1 |

DOIs | |

Publication status | Published - Jan 1 1996 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Software
- Theoretical Computer Science
- Hardware and Architecture

### Cite this

**On the computational power of binary decision diagram with redundant variables.** / Yamada, Tetsuya; Yasuura, Hiroto.

Research output: Contribution to journal › Article

*Formal Methods in System Design*, vol. 8, no. 1, pp. 65-89. https://doi.org/10.1007/BF00121263

}

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

VL - 8

SP - 65

EP - 89

JO - Formal Methods in System Design

JF - Formal Methods in System Design

SN - 0925-9856

IS - 1

ER -