On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization

@inproceedings{Sieling1998OnTE,
  title={On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization},
  author={Detlef Sieling},
  booktitle={Electronic Colloquium on Computational Complexity},
  year={1998}
}
The size of Ordered Binary Decision Diagrams (OBDDs) is determined by the chosen variable ordering. A poor choice may cause an OBDD to be too large to fit into the available memory. The decision variant of the variable ordering problem is known to be -complete. We strengthen this result by showing that there in no polynomial time approximation scheme for the variable ordering problem unless . We also prove a small lower bound on the performance ratio of a polynomial time approximation algorithm… CONTINUE READING

References

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

Variable orderings and the size of OBDDs for partially symmetric Boolean functions, in “Proc. of the Synthesis and System Integration of Mixed Technologies SASIMI,

D. Sieling
Random Structures & Algorithms • 1996
View 6 Excerpts
Highly Influenced

Improving the Variable Ordering of OBDDs Is NP-Complete

IEEE Trans. Computers • 1996
View 15 Excerpts
Highly Influenced

Randomized Algorithms

SIGACT News • 1995
View 1 Excerpt

Simulated annealing to improve variable orderings for OBDDs, in “Proc. of International Workshop on Logic Synthesis IWLS,

B. Bollig, M. Löbbing, I. Wegener
1995

Similar Papers

Loading similar papers…