A simpler counterexample to a long-standing conjecture on the complexity of Bryant's apply algorithm (Q2445400): Difference between revisions

@@ Property / Wikidata QID @@
+Q122987287
@@ Property / Wikidata QID: Q122987287 / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+CUDD
@@ Property / describes a project that uses: CUDD / rank @@
+Normal rank
@@ 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.1016/j.ipl.2013.11.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2086361927
@@ Property / OpenAlex ID: W2086361927 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact OBDD bounds for some fundamental functions
@@ Property / cites work: Exact OBDD bounds for some fundamental functions / rank @@
+Normal rank
@@ Property / cites work @@
+Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems
+Normal rank
@@ Property / cites work @@
+Graph-Based Algorithms for Boolean Function Manipulation
+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 @@
+Counterexamples to the long-standing conjecture on the complexity of BDD binary operations
+Normal rank