Implicit characterizations of FPTIME and NC revisited (Q1044672)
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 5650090
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Implicit characterizations of FPTIME and NC revisited |
scientific article; zbMATH DE number 5650090 |
Statements
Implicit characterizations of FPTIME and NC revisited (English)
0 references
18 December 2009
0 references
bounded and ramified forms of recursion
0 references
function algebra
0 references
implicit computational complexity
0 references
NC
0 references
polynomial-time computability
0 references
0.82898283
0 references
0.8236401
0 references
0.8230233
0 references
0.8216443
0 references
0.8189231
0 references
0.8168351
0 references
