The \(\mu\)-measure as a tool for classifying computational complexity (Q1590662): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:20, 1 February 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
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
