Graph driven BDDs -- a new data structure for Boolean functions (Q673788): Difference between revisions

@@ Property / cites work @@
+Binary decision tree test functions
@@ Property / cites work: Binary decision tree test functions / rank @@
+Normal rank
@@ Property / cites work @@
+Binary Decision Diagrams
@@ Property / cites work: Binary Decision Diagrams / rank @@
+Normal rank
@@ Property / cites work @@
+Equivalence of free Boolean graphs can be decided probabilistically in polynomial time
+Normal rank
@@ Property / cites work @@
+On the size of binary decision diagrams representing Boolean functions
+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 @@
+Q4160379
@@ Property / cites work: Q4160379 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4281560
@@ Property / cites work: Q4281560 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial size \(\Omega\)-branching programs and their computational power
+Normal rank
@@ Property / cites work @@
+Reduction of OBDDs in linear time
@@ Property / cites work: Reduction of OBDDs in linear time / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(94)00078-w
+Normal rank
@@ Property / OpenAlex ID @@
+W1968923513
@@ Property / OpenAlex ID: W1968923513 / rank @@
+Normal rank