Separating $\oplus L$ from $L, NL,$ co-$NL$, and $AL = P$ for oblivious Turing machines of linear access (Q4032302): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W178272701 / rank | |||
Normal rank | |||
Revision as of 01:47, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Separating $\oplus L$ from $L, NL,$ co-$NL$, and $AL = P$ for oblivious Turing machines of linear access |
scientific article |
Statements
Separating $\oplus L$ from $L, NL,$ co-$NL$, and $AL = P$ for oblivious Turing machines of linear access (English)
0 references
1 April 1993
0 references
lower bounds
0 references
parity branching programs
0 references
Turing machines
0 references
