A strong induction scheme that leads to polynomially computable realizations (Q1885030)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A strong induction scheme that leads to polynomially computable realizations |
scientific article; zbMATH DE number 2111103
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A strong induction scheme that leads to polynomially computable realizations |
scientific article; zbMATH DE number 2111103 |
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
