Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity
- 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
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.
Unable to display preview. Download preview PDF.