The \(\mu\)-measure as a tool for classifying computational complexity (Q1590662)

From MaRDI portal
Revision as of 15:40, 23 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
The \(\mu\)-measure as a tool for classifying computational complexity
scientific article

    Statements

    The \(\mu\)-measure as a tool for classifying computational complexity (English)
    0 references
    0 references
    16 July 2001
    0 references
    simply typed term systems
    0 references
    primitive recursive functions
    0 references
    computational complexity
    0 references
    Grzegorczyk classes
    0 references
    Heinermann class
    0 references
    polynomial time computable functions
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references