Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH scholarly article en Dixon, Peter; Mandal, Debasis; Pavan, A.; Vinodchandran, N. V. http://www.dagstuhl.de/lipics License
when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-65003
URL:

; ; ;

A Note on the Advice Complexity of Multipass Randomized Logspace

pdf-format:


Abstract

Investigating the complexity of randomized space-bounded machines that are allowed to make multiple passes over the random tape has been of recent interest. In particular, it has been shown that derandomizing such probabilistic machines yields a weak but new derandomization of probabilistic time-bounded classes. In this paper we further explore the complexity of such machines. In particular, as our main result we show that for any epsilon<1, every language that is accepted by an O(n^epsilon)-pass, randomized logspace machine can be simulated in deterministic logspace with linear amount of advice. This result extends an earlier result of Fortnow and Klivans who showed that RL is in deterministic logspace with linear advice.

BibTeX - Entry

@InProceedings{dixon_et_al:LIPIcs:2016:6500,
  author =	{Peter Dixon and Debasis Mandal and A. Pavan and N. V. Vinodchandran},
  title =	{{A Note on the Advice Complexity of Multipass Randomized Logspace}},
  booktitle =	{41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)},
  pages =	{31:1--31:7},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-016-3},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{58},
  editor =	{Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6500},
  URN =		{urn:nbn:de:0030-drops-65003},
  doi =		{10.4230/LIPIcs.MFCS.2016.31},
  annote =	{Keywords: space-bounded computations, randomized machines, advice}
}

Keywords: space-bounded computations, randomized machines, advice
Seminar: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
Issue date: 2016
Date of publication: 2016


DROPS-Home | Fulltext Search | Imprint Published by LZI