A strong induction scheme that leads to polynomially computable realizations (Q1885030): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the computational power of pushdown automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Intuitionistic formal theories with realizability in subrecursive classes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3800030 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5670174 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5812175 / rank | |||
Normal rank | |||
Revision as of 13:53, 7 June 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
