Hierarchy of complexity of computation of partial functions with values 0 and 1 (Q1149431): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 05:23, 31 January 2024

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

    Hierarchy of complexity of computation of partial functions with values 0 and 1 (English)
    0 references
    0 references
    0 references
    1981
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    complexity classes
    0 references
    partial functions
    0 references
    Turing machine
    0 references