scientific article
From MaRDI portal
Publication:3002807
DOI10.4086/toc.2009.v005a008zbMath1213.68297OpenAlexW2218607027MaRDI QIDQ3002807
Publication date: 24 May 2011
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2009.v005a008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorial probability (60C05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (15)
Finding the Median (Obliviously) with Bounded Space ⋮ Arguments of Proximity ⋮ Anchored Parallel Repetition for Nonlocal Games ⋮ A direct product theorem for two-party bounded-round public-coin communication complexity ⋮ Unnamed Item ⋮ Flexible constrained de Finetti reductions and applications ⋮ Parallel Repetition of Two-Prover One-Round Games: An Exposition ⋮ Compressing Interactive Communication Under Product Distributions ⋮ Dimension Reduction for Polynomials over Gaussian Space and Applications ⋮ Optimality of Correlated Sampling Strategies ⋮ Unnamed Item ⋮ Communication Complexity of Statistical Distance ⋮ Unnamed Item ⋮ A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence ⋮ A parallel repetition theorem for entangled projection games
This page was built for publication:
