On threshold BDDs and the optimal variable ordering problem (Q1016038): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-007-9123-z
+Normal rank
@@ Property / OpenAlex ID @@
+W2797533443
@@ Property / OpenAlex ID: W2797533443 / rank @@
+Normal rank
@@ Property / cites work @@
+Experimental and Efficient Algorithms
@@ Property / cites work: Experimental and Efficient Algorithms / 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 @@
+Q4431379
@@ Property / cites work: Q4431379 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2749862
@@ Property / cites work: Q2749862 / rank @@
+Normal rank
@@ Property / cites work @@
+Size of ordered binary decision diagrams representing threshold functions
+Normal rank
@@ Property / cites work @@
+Q4219538
@@ Property / cites work: Q4219538 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3818127
@@ Property / cites work: Q3818127 / rank @@
+Normal rank
@@ Property / cites work @@
+Hard examples for resolution
@@ Property / cites work: Hard examples for resolution / 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 @@
+Lectures on Polytopes
@@ Property / cites work: Lectures on Polytopes / rank @@
+Normal rank