Better upper bounds on the QOBDD size of integer multiplication (Q2370421): Difference between revisions

@@ Property / cites work @@
+A lower bound for integer multiplication on randomized ordered read-once branching programs.
+Normal rank
@@ Property / cites work @@
+Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems
+Normal rank
@@ Property / cites work @@
+A read-once branching program lower bound of Ω(2             <sup>n/4</sup>             ) for integer multiplication using universal hashing
+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 @@
+Finding the optimal variable ordering for binary decision diagrams
+Normal rank
@@ Property / cites work @@
+On the OBDD-representation of general Boolean functions
+Normal rank
@@ Property / cites work @@
+Q4388806
@@ Property / cites work: Q4388806 / rank @@
+Normal rank
@@ Property / cites work @@
+A Lower Bound for Integer Multiplication with Read-Once Branching Programs
+Normal rank
@@ Property / cites work @@
+Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions
+Normal rank
@@ Property / cites work @@
+The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions
+Normal rank
@@ Property / cites work @@
+BDDs -- design, analysis, complexity, and applications.
+Normal rank
@@ Property / cites work @@
+Bounds on the OBDD-size of integer multiplication via universal hashing
+Normal rank