An arithmetic for non-size-increasing polynomial-time computation (Q1827388)
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: An arithmetic for non-size-increasing polynomial-time computation |
scientific article; zbMATH DE number 2083401
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An arithmetic for non-size-increasing polynomial-time computation |
scientific article; zbMATH DE number 2083401 |
Statements
An arithmetic for non-size-increasing polynomial-time computation (English)
0 references
6 August 2004
0 references
Arithmetic
0 references
Implicit computational complexity
0 references
Non-size-increasing polynomial-time computation
0 references
Realizability
0 references
Higher types
0 references
Lambda calculus
0 references
0.8018361330032349
0 references
0.7907396554946899
0 references
0.7891176342964172
0 references
0.7742695808410645
0 references
