On the OBDD Complexity of the Most Significant Bit of Integer Multiplication (Q3502656): Difference between revisions

@@ 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.1007/978-3-540-79228-4_27
+Normal rank
@@ Property / OpenAlex ID @@
+W1499765196
@@ Property / OpenAlex ID: W1499765196 / rank @@
+Normal rank
@@ Property / cites work @@
+Better upper bounds on the QOBDD size of integer multiplication
+Normal rank
@@ Property / cites work @@
+Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication
+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 @@
+Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication
+Normal rank
@@ Property / cites work @@
+A lower bound technique for nondeterministic graph-driven read-once-branching programs and its applications
+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 @@
+Q3549597
@@ Property / cites work: Q3549597 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4337605
@@ Property / cites work: Q4337605 / rank @@
+Normal rank
@@ Property / cites work @@
+Communication Complexity
@@ Property / cites work: Communication Complexity / 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 @@
+SOFSEM 2006: Theory and Practice of Computer Science
+Normal rank
@@ Property / cites work @@
+Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic 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 @@
+Bounds on the OBDD-size of integer multiplication via universal hashing
+Normal rank