Charles M. Harris. Enumeration Reducibility with Polynomial Time Bounds. In Arnold Beckmann, Ulrich Berger, Benedikt Löwe, John V. Tucker, editors, Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings. Volume 3988 of Lecture Notes in Computer Science, pages 209-220, Springer, 2006. [doi]
Abstract is missing.