The \(\mu\)-measure as a tool for classifying computational complexity (Q1590662): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:02, 5 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
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
