A strong induction scheme that leads to polynomially computable realizations (Q1885030): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2004.03.023 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2004.03.023 / rank | |||
Normal rank | |||
Latest revision as of 11:44, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A strong induction scheme that leads to polynomially computable realizations |
scientific article |
Statements
A strong induction scheme that leads to polynomially computable realizations (English)
0 references
27 October 2004
0 references
Computational complexity
0 references
Polynomial time computability
0 references
Intuitionistic theories
0 references
Induction scheme
0 references
