A strong induction scheme that leads to polynomially computable realizations
type: Item
instance of: scholarly article
title: A strong induction scheme that leads to polynomially computable realizations
zbMATH Open document ID: 1087.68041
author: Anatoly Petrivich Beltiukov
published in: Theoretical Computer Science
publication date: 2004-10-27T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 03D15
zbMATH DE Number: 2111103
zbMATH Keywords: Computational complexity
zbMATH Keywords: Polynomial time computability
zbMATH Keywords: Intuitionistic theories
zbMATH Keywords: Induction scheme
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.03.023
OpenAlex ID: W2006885584
cites work: On the computational power of pushdown automata
cites work: Intuitionistic formal theories with realizability in subrecursive classes
cites work: Q3800030
cites work: Q5670174
cites work: Q5812175
DOI: 10.1016/J.TCS.2004.03.023
description: scientific article; zbMATH DE number 2111103