Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication (Q2508966): Difference between revisions

@@ Property / cites work @@
+Determinism versus non-determinism for linear time RAMs (extended abstract)
+Normal rank
@@ Property / cites work @@
+Linear hash functions
@@ Property / cites work: Linear hash functions / rank @@
+Normal rank
@@ Property / cites work @@
+Meanders and their applications in lower bounds arguments
+Normal rank
@@ Property / cites work @@
+Time-space tradeoffs for branching programs
@@ Property / cites work: Time-space tradeoffs for branching programs / rank @@
+Normal rank
@@ Property / cites work @@
+Time-space trade-off lower bounds for randomized computation of decision problems
+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 @@
+On lower bounds for read-\(k\)-times branching programs
+Normal rank
@@ Property / cites work @@
+Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2003
@@ Property / cites work: Mathematical Foundations of Computer Science 2003 / rank @@
+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 @@
+Universal classes of hash functions
@@ Property / cites work: Universal classes of hash functions / rank @@
+Normal rank
@@ Property / cites work @@
+Universal hashing and k-wise independent random variables via integer arithmetic without primes
+Normal rank
@@ Property / cites work @@
+A Reliable Randomized Algorithm for the Closest-Pair Problem
+Normal rank
@@ Property / cites work @@
+Efficient Boolean manipulation with OBDD's can be extended to FBDD's
+Normal rank
@@ Property / cites work @@
+Separating $\oplus L$ from $L, NL,$ co-$NL$, and $AL = P$ for oblivious Turing machines of linear access
+Normal rank
@@ Property / cites work @@
+Polynomial size \(\Omega\)-branching programs and their computational power
+Normal rank
@@ Property / cites work @@
+A Lower Bound for Integer Multiplication with Read-Once Branching Programs
+Normal rank
@@ Property / cites work @@
+Q4536401
@@ Property / cites work: Q4536401 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph driven BDDs -- a new data structure for Boolean functions
+Normal rank
@@ Property / cites work @@
+Q4542589
@@ Property / cites work: Q4542589 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3762226
@@ Property / cites work: Q3762226 / 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 @@
+Q4941908
@@ Property / cites work: Q4941908 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2762533
@@ Property / cites work: Q2762533 / rank @@
+Normal rank