On the Power of Different Types of Restricted Branching Programs

@article{Bollig1994OnTP,
  title={On the Power of Different Types of Restricted Branching Programs},
  author={Beate Bollig and Martin Sauerhoff and Detlef Sieling and Ingo Wegener},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  year={1994},
  volume={1}
}
Almost the same types of restricted branching programs (or binary decision diagrams BDDs) are considered in complexity theory and in applications like hardware veriication. These models are read-once branching programs (free BDDs) and certain types of oblivious branching programs (ordered and indexed BDDs with k layers). The complexity of the satissability problem for these restricted branching programs is investigated and tight hierarchy results are proved for the classes of functions… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 25 references

A Boolean function

  • E. I. ciporuk
  • Soviet Mathematics Doklady
  • 1966
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…