The \(\mu\)-measure as a tool for classifying computational complexity (Q1590662): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s001530050163 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2043102901 / rank
 
Normal rank

Latest revision as of 21:32, 19 March 2024

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
    0 references
    16 July 2001
    0 references
    0 references
    0 references
    0 references
    0 references
    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
    0 references