Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\) (Q1178711): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4726174 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Alternation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3821583 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lower bounds on the complexity of real-time branching programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3779737 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lower bounds on monotone complexity of the logical permanent / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A complexity theory based on Boolean algebra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3815544 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3762226 / rank | |||
Normal rank |
Latest revision as of 11:47, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\) |
scientific article |
Statements
Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\) (English)
0 references
26 June 1992
0 references
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.
0 references
Turing machines
0 references
branching programs
0 references