A strong induction scheme that leads to polynomially computable realizations (Q1885030): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:06, 1 February 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
