TY - GEN
T1 - A note on the advice complexity of multipass randomized logspace
AU - Dixon, Peter
AU - Mandal, Debasis
AU - Pavan, A.
AU - Vinodchandran, N. V.
N1 - Publisher Copyright:
© Titus Dose.
PY - 2016/8/1
Y1 - 2016/8/1
N2 - 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 ϵ < 1, every language that is accepted by an O(nϵ)-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.
AB - 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 ϵ < 1, every language that is accepted by an O(nϵ)-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.
KW - Advice
KW - Randomized machines
KW - Space-bounded computations
UR - http://www.scopus.com/inward/record.url?scp=85012934458&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.MFCS.2016.31
DO - 10.4230/LIPIcs.MFCS.2016.31
M3 - Conference contribution
AN - SCOPUS:85012934458
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016
A2 - Muscholl, Anca
A2 - Faliszewski, Piotr
A2 - Niedermeier, Rolf
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
T2 - 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016
Y2 - 22 August 2016 through 26 August 2016
ER -