Arnold Beckmann. A Note on Universal Measures for Weak Implicit Computational Complexity. In Matthias Baaz, Andrei Voronkov, editors, Logic for Programming, Artificial Intelligence, and Reasoning, 9th International Conference, LPAR 2002, Tbilisi, Georgia, October 14-18, 2002, Proceedings. Volume 2514 of Lecture Notes in Computer Science, pages 53-67, Springer, 2002. [doi]
Abstract is missing.