Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\) (Q1178711): Difference between revisions

The main result of the paper consists in the following: there are strong differences in the computational power of deterministic, nondeterministic, co-nondeterministic and alternating eraser Turing machines. The technique of the proof is based on exponential lower and polynomial upper bounds for read-once-only \(\Omega\)- branching programs.