Separating $\oplus L$ from $L, NL,$ co-$NL$, and $AL = P$ for oblivious Turing machines of linear access (Q4032302)

From MaRDI portal
Revision as of 15:40, 17 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    1 April 1993
    0 references
    0 references
    lower bounds
    0 references
    parity branching programs
    0 references
    Turing machines
    0 references
    0 references