4 citations · 4 across the 2 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2023
Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories
Melissa Antonelli, Ugo Dal Lago, Davide Davoli +2
We consider a minimal extension of the language of arithmetic, such that the bounded formulas provably total in a suitably-defined theory à la Buss (expressed in this new language)…
cs.LO2011★ 4 cited
An applicative theory for FPH
Reinhard Kahle, Isabel Oitavem
In this paper we introduce an applicative theory which characterizes the polynomial hierarchy of time.