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 NP-complete. We strengthen this result by showing that there is no polynomial time approximation scheme for the variable ordering problem unless P = NP. We also prove a small lower bound on the performance ratio of a polynomial time approximation algorithm under the assumption P ≠ NP. © 1998 Springer-Verlag.
CITATION STYLE
Sieling, D. (1998). On the existence of polynomial time approximation schemes for OBDD minimization (extended abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1373 LNCS, pp. 205–215). https://doi.org/10.1007/BFb0028562
Mendeley helps you to discover research relevant for your work.