Characterizing polynomial and exponential complexity classes in elementary lambda-calculus (Q1640981)
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 6889846
| 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 6889846 |
Statements
Characterizing polynomial and exponential complexity classes in elementary lambda-calculus (English)
0 references
14 June 2018
0 references
implicit computational complexity
0 references
linear logic
0 references
lambda-calculus
0 references
0 references
0 references
0.99538654088974
0 references
0.8115091323852539
0 references
0.7754023671150208
0 references
0.7712791562080383
0 references
0.7649574279785156
0 references
