A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
On the Structure of Logspace Probabilistic Complexity Classes
2000
SIAM journal on computing (Print)
We investigate hierarchical properties and log-space reductions of languages recognized by log-space probabilistic Turing machines, Arthur-Merlin games and Games against Nature with log-space probabilistic veri ers. For each log-space complexity class, we decompose it into a hierarchy based on corresponding multihead two-way nite automata and we (eventually) prove the separation of the hierarchy levels (even over one letter alphabet); furthermore, we show log-space reductions of each log-space
doi:10.1137/s0097539796298339
fatcat:rmejwvw7irbpllyy4f57yvkffa