Optimal ordered binary decision diagrams for read-once formulas (Q1570838): Difference between revisions

@@ Property / cites work @@
+Learning read-once formulas with queries
@@ Property / cites work: Learning read-once formulas with queries / rank @@
+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 @@
+Learning Boolean read-once formulas over generalized bases
+Normal rank
@@ Property / cites work @@
+Q4320535
@@ Property / cites work: Q4320535 / rank @@
+Normal rank
@@ Property / cites work @@
+On read-once threshold formulae and their randomized decision tree complexity
+Normal rank
@@ Property / cites work @@
+Q4301239
@@ Property / cites work: Q4301239 / rank @@
+Normal rank
@@ Property / cites work @@
+The number of knight's tours equals 33, 439, 123, 484, 294---counting with binary decision diagrams
+Normal rank
@@ Property / cites work @@
+The nonapproximability of OBDD minimization
@@ Property / cites work: The nonapproximability of OBDD minimization / rank @@
+Normal rank
@@ Property / cites work @@
+Q4946959
@@ Property / cites work: Q4946959 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal decision trees and one-time-only branching programs for symmetric Boolean functions
+Normal rank
@@ Property / cites work @@
+Comments on "A characterization of binary decision diagrams"
+Normal rank
@@ Property / cites work @@
+Branching Programs and Binary Decision Diagrams
@@ Property / cites work: Branching Programs and Binary Decision Diagrams / rank @@
+Normal rank