Implicit characterizations of FPTIME and NC revisited (Q1044672): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jlap.2009.02.005 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JLAP.2009.02.005 / rank | |||
Normal rank | |||
Latest revision as of 14:38, 10 December 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
