Autoreducibility, mitoticity, and immunity

Lecture Notes in Computer Science

Volumn 3618, Issue , 2005, Pages 387-398

  Glaßer, Christian ^a   Ogihara, Mitsunori ^b   Pavan, A ^c   Selman, Alan L ^d   Zhang, Liyu ^d  

^a UNIVERSITY OF WÜRZBURG   (Germany)

^b UNIVERSITY OF ROCHESTER   (United States)

^c IOWA STATE UNIVERSITY   (United States)

^d UNIVERSITY AT BUFFALO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; PROBLEM SOLVING;

AUTOREDUCIBILITY; IMMUNITY; MITOTICITY;

SET THEORY;

EID: 26844543338     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11549345_34     Document Type: Conference Paper

References (31)

1. M. Agrawal. Pseudo-random generators and structure of complete degrees. In 17th Annual IEEE Conference on Computational Complexity, pages 139-145, 2002.
2. K. Ambos-Spies. P-mitotic sets. In E. Börger, G. Hasenjäger, and D. Roding, editors, Logic and Machines, Lecture Notes in Computer Science 177, pages 1-23. Springer-Verlag, 1984.
3. K. Ambos-Spies, H. Fleischhack, and H. Huwig. Diagonalizations over polynomial time computable sets. Theoretical Computer Science, 51:177-204, 1987.
4. K. Ambos-Spies, H. Neis, and A. Terwijn. Genericity and measure for exponential time. Theoretical Computer Science, 168(1):3-19, 1996.
5. J. Balcazar and E. Mayordomo. A note on genericty and bi-immunity. In Proceedings of the Tenth Annual IEEE Conference on Computational Complexity, pages 193-196, 1995.
6. J. Balcázar and U. Schöning. Bi-immune sets for complexity classes. Mathematical Systems Theory, 18(1):1-18, 1985.
7. R. Beigel and J. Feigenbaum. On being incoherent without being very hard. Computational Complexity, 2:1-17, 1992.
8. R. Beigel and J. Gill. Counting classes: Thresholds, parity, mods, and fewness. Theoretical Computer Science, 103:3-23, 1992.
9. L. Berman. Polynomial Reducibilities and Complete Sets. PhD thesis, Cornell University, Ithaca, NY, 1977.
10. H. Buhrman, L. Fortnow, D. van Melkebeek, and L. Torenvliet. Using autoreducibility to separate complexity classes. SIAM Journal on Computing, 29(5): 1497-1520, 2000.
11. H. Buhrman, A. Hoene, and L. Torenvliet. Splittings, robustness, and structure of complete sets. SIAM Journal on Computing, 27:637-653, 1998.
12. H. Buhrman and L. Torenvliet. On the structure of complete sets. In Proceedings 9th Structure in Complexity Theory, pages 118-133, 1994.
13. H. Buhrman and L. Torenvliet. Complete sets and structure in subrecursive classes. In Proceedings of Logic Colloquium '96, pages 45-78. Springer-Verlag, 1998.
14. H. Buhrman and L. Torenvliet. Separating complexity classes using structural properties. In Proceedings of the 19th IEEE Conference on Computational Complexity, pages 130-138, 2004.
15. H. Buhrman and L. Torenvliet. A Post's program for complexity theory. Bulleting of the EATCS, 85:41-51, 2005.
16. K. Ganesan and S. Homer. Complete problems and strong polynomial reducibilities. SIAM Journal on Computing, 21:733-742, 1992.
17. C. Glaßer, A. Pavan, A. Selman, and S. Sengupta. Properties of NP-complete sets. In Proceedings of the 19th Annual IEEE Conference on Computational Complexity, pages 184-197, 2004.
18. U. Hertrampf, C. Lautemann, T. Schwentick, H. Vollmer, and K. W. Wagner. On the power of polynomial time bit-reductions. In Proceedings 8th Structure in Complexity Theory, pages 200-207, 1993.
19. S. Homer and A. Selman. Computability and Complexity Theory. Texts in Computer Science. Springer, New York, 2001.
20. D. W. Juedes and J. H. Lutz. The complexity and distribution of hard problems. SIAM Joutnal on Computing, 24:279-295, 1995.
21. R. Ladner. Mitotic recursively enumerable sets. Journal of Symbolic Logic, 38(2): 199-211, 1973.
22. M. Ogiwara and O. Watanabe. On polynomial-time bounded truth-table reducibility of NP sets to sparse sets. SIAM Journal of Computing, 20(3):471-483, 1991.
23. A. Pavan and A. Selman. Separation of NP-completeness notions. SIAM Journal on Computing, 31(3):906-918, 2002.
24. U. Schöning. Probabilistic complexity classes and lowness. Journal of Computer and System Sciences, 39:84-100, 1989.
25. L. Stockmeyer. The polynomial-time hierarchy. Theoretical Computer Science, 3:1-22, 1977.
26. B. Trahtenbrot. On autoreducibility. Dokl. Akad. Nauk SSSR, 192, 1970.
27. Translation in Soviet Math. Dokl. 11: 814- 817, 1970.
28. N. Tran. On P-immunity of nondeterministic complete sets. In Proceedings of the 10th Annual Conference on Structure in Complexity Theory, pages 262-263. IEEE Computer Society Press, 1995.
29. K. W. Wagner. Leaf language classes. In Proceedings International Conference on Machines, Computations, and Universality, volume 3354 of Lecture Notes in Computer Science. Springer Verlag, 2004.
30. C. Wrathall. Complete sets and the polynomial-time hierarchy. Theoretical Computer Science, 3:23-33, 1977.
31. A. Yao. Coherent functions and program checkers. In Proceedings of the 22nd Annual Symposium on Theory of Computing, pages 89-94, 1990.