On the computational power of binary decision diagram with redundant variables

Tetsuya Yamada, Hiroto Yasuura

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

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 languageEnglish
Pages (from-to)65-89
Number of pages25
JournalFormal Methods in System Design
Volume8
Issue number1
DOIs
Publication statusPublished - 1996

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture

Fingerprint Dive into the research topics of 'On the computational power of binary decision diagram with redundant variables'. Together they form a unique fingerprint.

Cite this