An arithmetic for non-size-increasing polynomial-time computation (Q1827388): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2003.10.023 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2051832719 / rank | |||
Normal rank | |||
Revision as of 23:21, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An arithmetic for non-size-increasing polynomial-time computation |
scientific article |
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
