scientific article; zbMATH DE number 6292622
From MaRDI portal
Publication:5414596
DOI10.4086/cjtcs.2012.001zbMath1286.68364OpenAlexW4248270945MaRDI QIDQ5414596
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: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (13)
Sketching and Embedding are Equivalent for Norms ⋮ Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications ⋮ Anticoncentration and the Exact Gap-Hamming Problem ⋮ Low correlation noise stability of symmetric sets ⋮ Communication complexity with small advantage ⋮ The communication complexity of functions with large outputs ⋮ Query-to-Communication Lifting for BPP ⋮ Unnamed Item ⋮ One-Sided Error Communication Complexity of Gap Hamming Distance. ⋮ Rectangles Are Nonnegative Juntas ⋮ Unnamed Item ⋮ Communication Complexity of Statistical Distance ⋮ Arthur-Merlin streaming complexity
This page was built for publication:
