Upper bounds on communication in terms of approximate rank
From MaRDI portal
Publication:6635689
DOI10.1007/S00224-023-10158-4MaRDI QIDQ6635689
Publication date: 12 November 2024
Published in: Theory of Computing Systems (Search for Journal in Brave)
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A discrepancy lower bound for information complexity
- Probabilistic communication complexity
- Complexity measures of sign matrices
- Private vs. common random bits in communication complexity
- On the distributional complexity of disjointness
- Geometric arguments yield better bounds for threshold circuits and distributed computing
- On rank vs. communication complexity
- The Cover Number of a Matrix and its Algorithmic Applications
- Communication is Bounded by Root of Rank
- Lower Bounds in Communication Complexity
- Perturbed Identity Matrices Have High Rank: Proof and Applications
- Learning Complexity vs Communication Complexity
- The Probabilistic Communication Complexity of Set Intersection
- Deterministic Communication vs. Partition Number
- Quantum communication complexity of symmetric predicates
- Communication Complexity
- The Log-Approximate-Rank Conjecture Is False
- En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations
- Efficient quantum protocols for XOR functions
- Lower Bounds for Quantum Communication Complexity
- The approximate rank of a matrix and its algorithmic applications
- An Additive Combinatorics Approach Relating Rank to Communication Complexity
- Lower bounds in communication complexity based on factorization norms
This page was built for publication: Upper bounds on communication in terms of approximate rank
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635689)
