On the descriptive and algorithmic power of parity ordered binary decision diagrams (Q1854421): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1006/inco.2000.3022
+Normal rank
@@ Property / OpenAlex ID @@
+W2038757167
@@ Property / OpenAlex ID: W2038757167 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams
+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 @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / 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 @@
+Efficient data structures for Boolean functions
@@ Property / cites work: Efficient data structures for Boolean functions / rank @@
+Normal rank
@@ Property / cites work @@
+Q4885894
@@ Property / cites work: Q4885894 / rank @@
+Normal rank