2015 | OriginalPaper | Chapter
On Probabilistic Space-Bounded Machines with Multiple Access to Random Tape
Authors : Debasis Mandal, A. Pavan, N. V. Vinodchandran
Published in: Mathematical Foundations of Computer Science 2015
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
-
For some integer \(k>0\), if all the languages accepted by bounded-error randomized log-space machines that use \(O(\log n \log ^{(k+3)} n)\) random bits and make \(O(\log ^{(k)} n)\) passes over the random tape is in deterministic polynomial-time, then \(\mathrm{ BPTIME}(n) \subseteq \mathrm{ DTIME}(2^{o(n)})\). Here \(\log ^{(k)} n\) denotes \(\log \) function applied k times iteratively.