Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity

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.

• Type: Journal
• Year: 2010
• Where: ISAAC
• Authors: Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux
• Keywords: Algorithms, Basic Feasible Functions, ISAAC 2010, Order Functional Stream, Polynomial Time Complexity