Implicit characterizations of FPTIME and NC revisited (Q1044672): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:55, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Implicit characterizations of FPTIME and NC revisited |
scientific article |
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
