Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity

  • Hugo Férée
  • Emmanuel Hainry
  • Mathieu Hoyrup
  • Romain Péchoux
Conference paper

DOI: 10.1007/978-3-642-17517-6_27

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6506)
Cite this paper as:
Férée H., Hainry E., Hoyrup M., Péchoux R. (2010) Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity. In: Cheong O., Chwa KY., Park K. (eds) Algorithms and Computation. ISAAC 2010. Lecture Notes in Computer Science, vol 6506. Springer, Berlin, Heidelberg

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 characterizations 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Hugo Férée
    • 1
  • Emmanuel Hainry
    • 2
    • 5
  • Mathieu Hoyrup
    • 3
    • 5
  • Romain Péchoux
    • 4
    • 5
  1. 1.ENS LyonLyon cedex 07France
  2. 2.Université Henri Poincaré, Nancy-UniversitéFrance
  3. 3.INRIA Nancy - Grand Est, Villers-lès-NancyFrance
  4. 4.Université Nancy 2, Nancy-UniversitéFrance
  5. 5.LORIAVandœuvre-lès-Nancy cedexFrance

Personalised recommendations