Upper bounds on communication in terms of approximate rank (Q2117081): Difference between revisions

@@ Property / cites work @@
+Q3002757
@@ Property / cites work: Q3002757 / rank @@
+Normal rank
@@ Property / cites work @@
+Perturbed Identity Matrices Have High Rank: Proof and Applications
+Normal rank
@@ Property / cites work @@
+The approximate rank of a matrix and its algorithmic applications
+Normal rank
@@ Property / cites work @@
+Q5111154
@@ Property / cites work: Q5111154 / rank @@
+Normal rank
@@ Property / cites work @@
+A discrepancy lower bound for information complexity
+Normal rank
@@ Property / cites work @@
+Q4542521
@@ Property / cites work: Q4542521 / rank @@
+Normal rank
@@ Property / cites work @@
+The Log-Approximate-Rank Conjecture Is False
@@ Property / cites work: The Log-Approximate-Rank Conjecture Is False / rank @@
+Normal rank
@@ Property / cites work @@
+Q4474216
@@ Property / cites work: Q4474216 / rank @@
+Normal rank
@@ Property / cites work @@
+En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations
+Normal rank
@@ Property / cites work @@
+Deterministic Communication vs. Partition Number
@@ Property / cites work: Deterministic Communication vs. Partition Number / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228473
@@ Property / cites work: Q4228473 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4736848
@@ Property / cites work: Q4736848 / rank @@
+Normal rank
@@ Property / cites work @@
+The Probabilistic Communication Complexity of Set Intersection
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Quantum Communication Complexity
@@ Property / cites work: Lower Bounds for Quantum Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric arguments yield better bounds for threshold circuits and distributed computing
+Normal rank
@@ Property / cites work @@
+Communication Complexity
@@ Property / cites work: Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds in Communication Complexity
@@ Property / cites work: Lower Bounds in Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity measures of sign matrices
@@ Property / cites work: Complexity measures of sign matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Learning Complexity vs Communication Complexity
@@ Property / cites work: Learning Complexity vs Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds in communication complexity based on factorization norms
+Normal rank
@@ Property / cites work @@
+Communication is Bounded by Root of Rank
@@ Property / cites work: Communication is Bounded by Root of Rank / rank @@
+Normal rank
@@ Property / cites work @@
+Q4819589
@@ Property / cites work: Q4819589 / rank @@
+Normal rank
@@ Property / cites work @@
+Private vs. common random bits in communication complexity
+Normal rank
@@ Property / cites work @@
+Quantum Computation and Quantum Information
@@ Property / cites work: Quantum Computation and Quantum Information / rank @@
+Normal rank
@@ Property / cites work @@
+On rank vs. communication complexity
@@ Property / cites work: On rank vs. communication complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic communication complexity
@@ Property / cites work: Probabilistic communication complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On the distributional complexity of disjointness
@@ Property / cites work: On the distributional complexity of disjointness / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum communication complexity of symmetric predicates
+Normal rank
@@ Property / cites work @@
+Efficient quantum protocols for XOR functions
@@ Property / cites work: Efficient quantum protocols for XOR functions / rank @@
+Normal rank