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

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