Direct Product via Round-Preserving Compression
From MaRDI portal
Publication:5326564
DOI10.1007/978-3-642-39206-1_20zbMath1336.68086OpenAlexW190822590MaRDI QIDQ5326564
Omri Weinstein, Mark Braverman, Amir Yehudayoff, Anup Rao
Publication date: 6 August 2013
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-39206-1_20
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Interactive Information Complexity ⋮ Interactive Information Complexity ⋮ A direct product theorem for two-party bounded-round public-coin communication complexity ⋮ Towards a reverse Newman's theorem in interactive information complexity ⋮ Certifying equality with limited interaction ⋮ Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness ⋮ Simulation theorems via pseudo-random properties ⋮ Unnamed Item ⋮ New Strong Direct Product Results in Communication Complexity ⋮ Lifting Theorems for Equality
