Characterizing polynomial time complexity of stream programs using interpretations - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2015

Characterizing polynomial time complexity of stream programs using interpretations

(1) , (1) , (1) , (1)
1

Abstract

This paper provides a criterion based on interpretation methods on term rewrite systems in order to characterize the polynomial time complexity of second order functionals. For that purpose it introduces a first order functional stream language that allows the programmer to implement second order functionals. This characterization is extended through the use of exp-poly interpretations as an attempt to capture the class of Basic Feasible Functionals (bff). Moreover, these results are adapted to provide a new characterization of polynomial time complexity in computable analysis. These characterizations give a new insight on the relations between the complexity of functional stream programs and the classes of functions computed by Oracle Turing Machine, where oracles are treated as inputs.
Fichier principal
Vignette du fichier
FEREE_HAINRY_HOYRUP_PECHOUX.pdf (374.77 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01112160 , version 1 (02-02-2015)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux. Characterizing polynomial time complexity of stream programs using interpretations. Theoretical Computer Science, 2015, 585, pp.41-54. ⟨10.1016/j.tcs.2015.03.008⟩. ⟨hal-01112160⟩
414 View
164 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More