Infinitely-often autoreducible sets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2906, Issue , 2003, Pages 98-107

  Beigel, Richard ^a   Fortnow, Lance ^b   Stephan, Frank ^c  

^a Temple University   (United States)

^b NEC LABORATORIES AMERICA   (United States)

^c UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

APPROXIMABILITY; AUTOREDUCIBILITY; COMPUTATION TIME; HAUSDORFF DIMENSION; POLYNOMIAL-TIME; SPECIAL SYMBOLS; TRUTH TABLES;

POLYNOMIAL APPROXIMATION;

EID: 35248847451     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24587-2_12     Document Type: Article

References (20)

1. Klaus Ambos-Spies, Hans Fleischhhack and Hagen Huwig. Diagonalizations over polynomial time computable sets. Theoretical Computer Science 51:177-204, 1997.
2. Klaus Ambos-Spies and Elvira Mayordomo. Resource-bounded measure and randomness. In A. Sorbi, editor, Complexity, Logic, and Recursion Theory, volume 187 of Lecture Notes in Pure and Applied Mathematics, pages 1-47, 1997.
3. Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann and Frank Stephan. Hausdorff dimension in exponential time. Proceedings Sixteenth Annual IEEE Conference on Computational Complexity, IEEE Computer Society, 210-217, 2001.
4. Klaus Ambos-Spies, Hans-Christian Neis and Sebastiaan A. Terwijn. Genericity and measure for exponential time. Theoretical Computer Science, 168:3-19, 1996.
5. José L. Balcázar and Elvira Mayordomo. A note on genericity and bi-immunity. Proceedings of the Tenths Annual Structure in Complexity Theory Conference, IEEE Computer Society Press, pages 193-196, 1995.
6. Richard Beigel. Bi-immunity results for cheatable sets. Theoretical Computer Science, 73:249-263, 1990.
7. Richard Beigel, Lance Fortnow and Frank Stephan. Infinite-often autoreducible sets. Forschungsberichte Mathematische Logik und Theoretische Informatik, 62 / 2003. Institut für Informatik, Universität Heidelberg, 2003. http://www.math.uni-heidelberg.de/logic/postscripts/tr62.ps
8. Richard Beigel, Martin Kummer and Frank Stephan. Approximable sets. Information and Computation, 120:304-314, 1995.
9. ∼ebert/hatProblem/dieZeit.htm
10. Harry Buhrman, Lance Fortnow, Dieter van Melkebeek and Leen Torenvliet. Using autoreducibility to separate complexity classes. Siam Journal on Computing, 29(5):1497-1520, 2000.
11. Todd Ebert. Applications of Recursive Operators to Randomness and Complexity. PhD Thesis, University of California at Santa Barbara, 1998.
12. Todd Ebert, Wolfgang Merkle and Heribert Vollmer. On the autoreducibility of random sequences. Manuscript, 2002.
13. Felix Hausdorff. Dimension und äusseres Maß. Mathematische Annalen, 79:157-189, 1919.
14. Martin Kummer and Frank Stephan. Recursion theoretic properties of frequency computation and bounded queries. Information and Computation, 120:59-77, 1995.
15. Jack H. Lutz. Category and measure in complexity classes. SIAM Journal on Computing, 19:1100-1131, 1990.
16. Jack H. Lutz. Dimension in complexity classes. Proceedings Fifteenth Annual IEEE Conference on Computational Complexity, IEEE Computer Society, 158-169, 2000.
17. Piergiorgio Odifreddi. Classical recursion theory. North-Holland, Amsterdam, 1989.
18. Mitsunori Ogihara. Polynomial-time membership comparable sets. In Proceedings of the 9th Conference on Structure in Complexity Theory, IEEE Computer Society Press, 2-11, 1994.
19. Boris A. Trakhtenbrot. On autoreducibility. Soviet Mathematics Doklady 11:814-817, 1970.
20. Osamu Watanabe. A comparison of polynomial time completeness notions. Theoretical Computer Science 54:249-265, 1987.