Space-bounded probabilistic turing machine complexity classes are closed under complement (Preliminary Version)
Janoš Šimon · 1981
For tape constructible functions S(n)≥log n, if a language L is accepted by an S(n) tape bounded probabilistic Turing machine, then there is an S(n) tape bounded probabilistic Turing machine that accepts L, the complement of L.