Search Results

Abstract

Cite as

Maya Leshkowitz. Round Complexity Versus Randomness Complexity in Interactive Proofs. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 116, pp. 49:1-49:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

@InProceedings{leshkowitz:LIPIcs.APPROX-RANDOM.2018.49,
  author =	{Leshkowitz, Maya},
  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 =	{Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.49},
  URN =		{urn:nbn:de:0030-drops-94530},
  doi =		{10.4230/LIPIcs.APPROX-RANDOM.2018.49},
  annote =	{Keywords: Interactive Proofs}
}