Larger lower bounds on the OBDD complexity of integer multiplication (Q553298): Difference between revisions

@@ Property / DOI @@
-.1016/j.ic.2010.11.007
@@ Property / DOI: 10.1016/j.ic.2010.11.007 / 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.ic.2010.11.007
+Normal rank
@@ Property / OpenAlex ID @@
+W2088302362
@@ Property / OpenAlex ID: W2088302362 / rank @@
+Normal rank
@@ Property / cites work @@
+Better upper bounds on the QOBDD size of integer multiplication
+Normal rank
@@ Property / cites work @@
+A note on the size of OBDDs for the graph of integer multiplication
+Normal rank
@@ Property / cites work @@
+On the OBDD Complexity of the Most Significant Bit of Integer Multiplication
+Normal rank
@@ Property / cites work @@
+Q3397629
@@ Property / cites work: Q3397629 / rank @@
+Normal rank
@@ Property / cites work @@
+New Results on the Most Significant Bit of Integer Multiplication
+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 @@
+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 @@
+Q4471346
@@ Property / cites work: Q4471346 / rank @@
+Normal rank
@@ Property / cites work @@
+Symbolic graphs: Linear solutions to connectivity related problems
+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 @@
+An asymptotically optimal lower bound on the OBDD size of the middle bit of multiplication for the pairwise ascending variable order
+Normal rank
@@ Property / cites work @@
+Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions
+Normal rank
@@ Property / cites work @@
+SOFSEM 2005: Theory and Practice of Computer Science
+Normal rank
@@ Property / cites work @@
+Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms
+Normal rank
@@ Property / cites work @@
+Reduction of OBDDs in linear time
@@ Property / cites work: Reduction of OBDDs in linear time / rank @@
+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
@@ Property / cites work @@
+Symbolic topological sorting with OBDDs
@@ Property / cites work: Symbolic topological sorting with OBDDs / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.IC.2010.11.007
@@ Property / DOI: 10.1016/J.IC.2010.11.007 / rank @@
+Normal rank