License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2018.49
URN: urn:nbn:de:0030-drops-94530
URL: https://drops.dagstuhl.de/opus/volltexte/2018/9453/
Go to the corresponding LIPIcs Volume Portal

Leshkowitz, Maya

Round Complexity Versus Randomness Complexity in Interactive Proofs

pdf-format:
LIPIcs-APPROX-RANDOM-2018-49.pdf (0.5 MB)

Abstract

Consider an interactive proof system for some set S that has randomness complexity r(n) for instances of length n, and arbitrary round complexity. We show a public-coin interactive proof system for S of round complexity O(r(n)/log n). Furthermore, the randomness complexity is preserved up to a constant factor, and the resulting interactive proof system has perfect completeness.

BibTeX - Entry

@InProceedings{leshkowitz:LIPIcs:2018:9453,
  author =	{Maya Leshkowitz},
  title =	{{Round Complexity Versus Randomness Complexity in Interactive Proofs}},
  booktitle =	{Approximation, Randomization, and Combinatorial  Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
  pages =	{49:1--49:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-085-9},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{116},
  editor =	{Eric Blais and Klaus Jansen and Jos{\'e} D. P. Rolim and David Steurer},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9453},
  URN =		{urn:nbn:de:0030-drops-94530},
  doi =		{10.4230/LIPIcs.APPROX-RANDOM.2018.49},
  annote =	{Keywords: Interactive Proofs}
}

Keywords: Interactive Proofs
Collection: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)
Issue Date: 2018
Date of publication: 13.08.2018

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI