The \(\mu\)-measure as a tool for classifying computational complexity (Q1590662)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The \(\mu\)-measure as a tool for classifying computational complexity |
scientific article; zbMATH DE number 1547902
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The \(\mu\)-measure as a tool for classifying computational complexity |
scientific article; zbMATH DE number 1547902 |
Statements
The \(\mu\)-measure as a tool for classifying computational complexity (English)
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
