Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations (Q3893305)

From MaRDI portal
Revision as of 10:00, 20 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations
scientific article

    Statements

    Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations (English)
    0 references
    0 references
    0 references
    1980
    0 references
    nondeterminism
    0 references
    relativized polynomial-time bounded computations
    0 references
    class of languages acceptable by polynomial-time bounded Turing machines
    0 references
    relativized classes
    0 references
    oracle sets
    0 references

    Identifiers