The nonapproximability of OBDD minimization (Q1854498): Difference between revisions

@@ Property / cites work @@
+On the effect of local changes in the variable ordering of ordered decision diagrams
+Normal rank
@@ Property / cites work @@
+Improving the variable ordering of OBDDs is NP-complete
+Normal rank
@@ Property / cites work @@
+Graph-Based Algorithms for Boolean Function Manipulation
+Normal rank
@@ Property / cites work @@
+On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
+Normal rank
@@ Property / cites work @@
+Properties of complexity measures for PRAMs and WRAMs
+Normal rank
@@ Property / cites work @@
+Finding the optimal variable ordering for binary decision diagrams
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4526964
@@ Property / cites work: Q4526964 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for depth-restricted branching programs
+Normal rank
@@ Property / cites work @@
+On the complexity of constructing optimal ordered binary decision diagrams
+Normal rank
@@ Property / cites work @@
+Q4856179
@@ Property / cites work: Q4856179 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for the transformation between different types of binary decision diagrams
+Normal rank
@@ Property / cites work @@
+Variable orderings and the size of OBDDs for random partially symmetric Boolean functions
+Normal rank
@@ Property / cites work @@
+Q4268445
@@ Property / cites work: Q4268445 / rank @@
+Normal rank
@@ Property / cites work @@
+Branching Programs and Binary Decision Diagrams
@@ Property / cites work: Branching Programs and Binary Decision Diagrams / rank @@
+Normal rank