A strong induction scheme that leads to polynomially computable realizations

DOI10.1016/J.TCS.2004.03.023zbMath1087.68041OpenAlexW2006885584MaRDI QIDQ1885030

Anatoly Petrivich Beltiukov

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.03.023

zbMATH Keywords

Computational complexityInduction schemeIntuitionistic theoriesPolynomial time computability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)

Cites Work

• Intuitionistic formal theories with realizability in subrecursive classes
• On the computational power of pushdown automata
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A strong induction scheme that leads to polynomially computable realizations