Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems (Q5929919): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1006/jcss.2000.1733
+Normal rank
@@ Property / OpenAlex ID @@
+W2073480341
@@ Property / OpenAlex ID: W2073480341 / rank @@
+Normal rank
@@ 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 @@
+Q4337605
@@ Property / cites work: Q4337605 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on read-$k$ times branching programs
@@ Property / cites work: A note on read-$k$ times branching programs / rank @@
+Normal rank
@@ Property / cites work @@
+Neither reading few bits twice nor reading illegally helps much
+Normal rank
@@ Property / cites work @@
+On a problem of K. Zarankiewicz
@@ Property / cites work: On a problem of K. Zarankiewicz / rank @@
+Normal rank
@@ Property / cites work @@
+Communication Complexity
@@ Property / cites work: Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Reduction of OBDDs in linear time
@@ Property / cites work: Reduction of OBDDs in linear time / rank @@
+Normal rank
@@ Property / cites work @@
+Q3762226
@@ Property / cites work: Q3762226 / rank @@
+Normal rank
@@ Property / cites work @@
+Branching Programs and Binary Decision Diagrams
@@ Property / cites work: Branching Programs and Binary Decision Diagrams / rank @@
+Normal rank
@@ Property / cites work @@
+Worst case examples for operations on OBDDs
@@ Property / cites work: Worst case examples for operations on OBDDs / rank @@
+Normal rank