Interpretation of stream programs: characterizing type 2 polynomial time complexity - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Interpretation of stream programs: characterizing type 2 polynomial time complexity

Abstract

We study polynomial time complexity of type 2 functionals. For that purpose, we introduce a first order functional stream language. We give criteria, named well-founded, on such programs relying on second order interpretation that characterize two variants of type 2 polynomial complexity including the Basic Feasible Functions (BFF). These charac- terizations provide a new insight on the complexity of stream programs. Finally, we adapt these results to functions over the reals, a particular case of type 2 functions, and we provide a characterization of polynomial time complexity in Recursive Analysis.
Fichier principal
Vignette du fichier
paper.pdf (442.91 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00518381 , version 1 (17-09-2010)

Identifiers

  • HAL Id : inria-00518381 , version 1

Cite

Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux. Interpretation of stream programs: characterizing type 2 polynomial time complexity. 21st International Symposium on Algorithms and Computation - ISAAC 2010, Dec 2010, Jeju Island, South Korea. ⟨inria-00518381⟩
267 View
229 Download

Share

Gmail Facebook X LinkedIn More