Feasible computability and resource bounded topology (Q1891148)

From MaRDI portal
Revision as of 22:57, 28 July 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
Feasible computability and resource bounded topology
scientific article

    Statements

    Feasible computability and resource bounded topology (English)
    0 references
    0 references
    13 December 1995
    0 references
    Meyer-Stockmeyer polynomial hierarchy
    0 references
    boldface polynomial hierarchy
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references