Certifying Equality With Limited Interaction.
From MaRDI portal
Publication:2969646
DOI10.4230/LIPIcs.APPROX-RANDOM.2014.545zbMath1359.68082MaRDI QIDQ2969646
Ranganath Kondapally, David P. Woodruff, Amit Chakrabarti, Joshua Brody, Grigory Yaroslavtsev
Publication date: 22 March 2017
Full work available at URL: https://dblp.uni-trier.de/db/conf/approx/approx2014.html#BrodyCKWY14
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness, Unnamed Item, Direct sum fails for zero-error average communication, Certifying equality with limited interaction