Bounded query machines: on NP and PSPACE (Q1158751): Difference between revisions

From MaRDI portal
Added link to MaRDI 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: Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question / rank
 
Normal rank
Property / cites work
 
Property / cites work: A second step toward the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Languages Accepted in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Space and Transitive Closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: On languages accepted by space-bounded oracle machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On languages specified by relative acceptance / 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: A hierarchy for nondeterministic time complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating Nondeterministic Time Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lattices of prefixes and overlaps of traces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rudimentary Predicates and Relative Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time- and tape-bounded Turing acceptors and AFLs / rank
 
Normal rank

Revision as of 14:21, 13 June 2024

scientific article
Language Label Description Also known as
English
Bounded query machines: on NP and PSPACE
scientific article

    Statements

    Bounded query machines: on NP and PSPACE (English)
    0 references
    0 references
    1981
    0 references
    0 references
    languages accepted by nondeterministic polynomial space-bounded oracle machines
    0 references
    languages accepted by deterministic polynomial space-bounded oracle machines
    0 references