Knowledge compilation meets database theory: compiling queries to decision diagrams (Q359877): Difference between revisions

@@ Property / cites work @@
+A very simple function that requires exponential size read-once branching programs.
+Normal rank
@@ Property / cites work @@
+Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams
+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 @@
+On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
+Normal rank
@@ Property / cites work @@
+Q4411139
@@ Property / cites work: Q4411139 / rank @@
+Normal rank
@@ Property / cites work @@
+A simple function that requires exponential size read-once branching programs
+Normal rank
@@ Property / cites work @@
+Efficient Boolean manipulation with OBDD's can be extended to FBDD's
+Normal rank
@@ Property / cites work @@
+Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees
+Normal rank
@@ Property / cites work @@
+Q4120519
@@ Property / cites work: Q4120519 / rank @@
+Normal rank
@@ Property / cites work @@
+Equivalences Among Relational Expressions with the Union and Difference Operators
+Normal rank
@@ Property / cites work @@
+Graph driven BDDs -- a new data structure for Boolean functions
+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 @@
+BDDs -- design, analysis, complexity, and applications.
+Normal rank