Hardware algorithms for VLSI systems

Yasuura, Hiroto; Yajima, Shuzo

doi:10.1007/bfb0043450

Search citation statements

Order By: Relevance

Paper Sections

Select...

Definition 3 (Reduction Of Bdd)1

Citation Types

Supporting

Mentioning

Contrasting

Publication Types

Select...

Article1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…IBDD(b) seems to have different variable ordering on each layer. We define a sequence of BDDs following the definition of a sequence of Boolean functions 2 in [14]. A sequence of BDDs is an infinite set of BDDs which are characterized by a size parameter n. We define a sequence of IBDDs similarly.…”

Section: Definition 3 (Reduction Of Bdd)mentioning

confidence: 99%

On the computational power of binary decision diagram with redundant variables

Yamada

Yasuura

1996

Form Method Syst Des

Self Cite

View full text Add to dashboard Cite

We introduce a BDD with redundant variables as an Indexed BDD (IBDD) and define PolylBDD 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. PolylBDD = DLOG. That is to say that languages which belong to DLOG also belong to PolylBDD. We also show examples of polynomial-sized IBDD's construction from logarithmic space bounded DTMs.

show abstract

Section: Definition 3 (Reduction Of Bdd)mentioning

confidence: 99%