On relativizing auxiliary pushdown machines (Q3862402): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounded query machines: on NP and PSPACE / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounded query machines: on NP( ) and NPQUERY( ) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Characterizations of Pushdown Machines in Terms of Time-Bounded Computers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Relativization of questions about log space computability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Log space machines with multiple oracle tapes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Tape Complexity of Deterministic Context-Free Languages / rank | |||
Normal rank |
Revision as of 04:15, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On relativizing auxiliary pushdown machines |
scientific article |
Statements
On relativizing auxiliary pushdown machines (English)
0 references
1980
0 references
computational complexity classes relative to oracle sets
0 references
auxiliary pushdown machines
0 references
oracle Turing machines
0 references