Regular Article
Completeness and Non-Completeness Results with Respect to Read-Once Projections

https://doi.org/10.1006/inco.1998.2710Get rights and content
Under an Elsevier user license
open archive

Abstract

Several models of restricted branching programs or binary decision diagrams have a lot of applications in hardware verification. These models are investigated here from a complexity theoretical viewpoint. Because of depth restrictions projections are not suitable as reduction type and have to be restricted to read-once projections. Several types of polynomial-size binary decision diagrams have complete problems with respect to polynomial read-once projections. On the contrary it can be proved that the classes of polynomial-size decision trees and polynomial-size read-once branching programs or free binary decision diagrams do not have such complete problems.

Cited by (0)

*

Supported in part by DFG Grant We 1066/7.

f1

E-mail: {bollig, wegener}@ls2.informatik.uni-dortmund.de