Hierarchy of complexity of computation of partial functions with values 0 and 1 (Q1149431)

From MaRDI portal
Revision as of 11:32, 13 June 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
Hierarchy of complexity of computation of partial functions with values 0 and 1
scientific article

    Statements

    title
    Hierarchy of complexity of computation of partial functions with values 0 and 1 (English)
    0 references
    DOI
    10.1007/BF01158327
    0 references
    publication date
    1981
    0 references
    Mathematics Subject Classification ID
    03D15
    0 references
    03D10
    0 references
    03D55
    0 references
    03D20
    0 references
    zbMATH DE Number
    3710157
    0 references
    zbMATH Keywords
    complexity classes
    0 references
    partial functions
    0 references
    Turing machine
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1149431&oldid=34647973"
    Powered by MediaWiki