Time-Complexity Semantics for Feasible Affine Recursions

Norman Danner, James S. Royer. Time-Complexity Semantics for Feasible Affine Recursions. In S. Barry Cooper, Benedikt Löwe, Andrea Sorbi, editors, Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings. Volume 4497 of Lecture Notes in Computer Science, pages 205-217, Springer, 2007. [doi]

Authors

Norman Danner

This author has not been identified. Look up 'Norman Danner' in Google

James S. Royer

This author has not been identified. Look up 'James S. Royer' in Google