scientific article
From MaRDI portal
Publication:2913808
DOI10.4086/toc.2012.v008a008zbMath1253.68158OpenAlexW2122058331MaRDI QIDQ2913808
Publication date: 27 September 2012
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2012.v008a008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (16)
Sketching and Embedding are Equivalent for Norms ⋮ Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications ⋮ Interactive Information Complexity ⋮ 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 ⋮ Communication and information complexity ⋮ Query-to-Communication Lifting for BPP ⋮ One-Sided Error Communication Complexity of Gap Hamming Distance. ⋮ Rectangles Are Nonnegative Juntas ⋮ Unnamed Item ⋮ Lifting Theorems for Equality ⋮ Two Party Distribution Testing: Communication and Security ⋮ Communication Complexity of Statistical Distance ⋮ Arthur-Merlin streaming complexity
Cites Work
This page was built for publication:
