scientific article; zbMATH DE number 6292622
From MaRDI portal
Publication:5414596
DOI10.4086/CJTCS.2012.001zbMATH Open1286.68364OpenAlexW4248270945MaRDI QIDQ5414596FDOQ5414596
Authors: Thomas Vidick 
Publication date: 6 May 2014
Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/cjtcs.2012.001
Title of this publication is not available (Why is that?)
Recommendations
- An optimal lower bound on the communication complexity of gap-Hamming-distance
- An optimal lower bound on the communication complexity of gap-Hamming-distance
- The communication complexity of gap Hamming distance
- The communication complexity of the Hamming distance problem
- On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances
- On approximate enhanced covers under Hamming distance
- On the Hamming distance in combinatorial optimization problems on hypergraph matchings
- scientific article; zbMATH DE number 2086678
- On the variance of average distance of subsets in the Hamming space
- Erdős-Falconer distance problem under Hamming metric in vector spaces over finite fields
Cited In (16)
- An optimal lower bound on the communication complexity of gap-Hamming-distance
- Arthur-Merlin streaming complexity
- The communication complexity of functions with large outputs
- Rectangles are nonnegative juntas
- Anticoncentration and the Exact Gap-Hamming Problem
- Interleaved Group Products
- Sketching and embedding are equivalent for norms
- Query-to-communication lifting for BPP
- Title not available (Why is that?)
- Lower bounds on same-set inner product in correlated spaces
- Communication complexity of set-disjointness for all probabilities
- Lower bounds on information complexity via zero-communication protocols and applications
- Low correlation noise stability of symmetric sets
- Communication complexity of statistical distance
- One-sided error communication complexity of gap Hamming distance
- Communication complexity with small advantage
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5414596)
