A Note on the Advice Complexity of Multipass Randomized Logspace

DOI10.4230/LIPICS.MFCS.2016.31zbMath1398.68178OpenAlexW2536498892MaRDI QIDQ4608590

Debasis Mandal, N. V. Vinodchandran, Peter B. Dixon, A. Pavan

Publication date: 21 March 2018

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/6500/pdf/LIPIcs-MFCS-2016-31.pdf/

zbMATH Keywords

advicespace-bounded computationsrandomized machines

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

This page was built for publication: A Note on the Advice Complexity of Multipass Randomized Logspace