Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus (Q3190158)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6344700
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus |
scientific article; zbMATH DE number 6344700 |
Statements
Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus (English)
0 references
15 September 2014
0 references
implicit computational complexity
0 references
linear logic
0 references
lambda-calculus
0 references
1.0000001
0 references
0.91091406
0 references
0.8880354
0 references
0.88143784
0 references
0.8798349
0 references
