Generic separations and leaf languages

Mathematical Logic Quarterly

Volumn 49, Issue 4, 2003, Pages 353-362

  Galota, Matthias ^a   Kosub, Sven ^b   Vollmer, Heribert ^a  

^a LEIBNIZ UNIVERSITY HANNOVER   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Computational complexity; Generic oracle; Leaf language; Oracle separation; P NP problem; Structural complexity; Type 2 complexity theory

Indexed keywords

EID: 0038041492     PISSN: 09425616     EISSN: None     Source Type: Journal    
DOI: 10.1002/malq.200310037     Document Type: Article

References (20)

1. K. Ambos-Spies, Resource-bounded genericity. In: Computability, Enumerability, Unsolvability: Directions in Recursion Theory (S. B. Cooper, T. A. Slaman, and S. S. Wainer, eds.), London Mathematical Society Lecture Notes, vol. 224, pp. 1 - 59 (Cambride University Press, Cambridge 1996).
2. T. Baker, J. Gill, and R. Solovay, Relativizations of the P=NP problem. SIAM Journal on Computing 4, 431 - 442 (1975).
3. A with probability 1. SIAM Journal on Computing 10, 96-113 (1981).
4. M. Blum and R. Impagliazzo, Generic oracles and oracle classes. In: Proceedings 28th IEEE Symposium on Foundations of Computer Science, pp. 118 - 126 (IEEE Computer Society Press, 1987).
5. D. P. Bovet, P. Crescenzi, and R. Silvestri, A uniform approach to define complexity classes. Theoret. Comp. Sci. 104, 263-283 (1992).
6. R. Chang, B. Chor, O. Goldreich, J. Hartmanis, J. Hastad, D. Ranjan, and P. Rohatgi, The random oracle hypothesis is false. J. Computer System Sci. 49, 24 - 39 (1994).
7. S. A. Cook, R. Impagliazzo, and T. Yamakami, A tight relationship between generic oracles and type-2 complexity theory. Information and Computation 137, 159-170 (1997).
8. R. L. Constable, Type two computable functionals. In: Proceedings 5th Symposium on Theory of Computing, pp. 108-121 (ACM-Press, 1973).
9. S. Fenner, L. Fortnow, S. Kurtz, and L. Li, An oracle builder's toolkit. In: Proceedings 8th Structure in Complexity Theory, pp. 120-131 (IEEE Computer Society Press, 1993).
10. J. A. Foster, The generic oracle hypothesis is false, Information Processing Letters 45, 59 - 62 (1993).
11. J. Hartmanis and L. Hemachandra, Robust machines accept easy sets. Theoret. Comp. Sci. 74, 217 - 226 (1990).
12. S. Kosub, H. Schmilz, and H. Vollmer, Uniform characterizations of complexity classes of functions. Internat. J. Found. Comput. Sci. 11, 525 - 551 (2000).
13. S. Kosub and K. W. Wagner, The boolean hierarchy of NP-partitions. In: Proceedings 17th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, vol. 1770, pp. 157 - 168 (Springer-Verlag, Berlin 2000).
14. S. Kurtz, Notions of weak genericity. J. Symbolic Logic 48, 724 - 743 (1983).
15. K. Mehlhorn, Polynomial and abstract subrecursive classes. J. Computer and System Sci. 12, 147 - 178 (1976).
16. C. H. Papadimitriou, Computational Complexity (Addison-Wesley, Reading, MA, 1994).
17. R. I. Soare, Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets (Springer Verlag, Berlin-Heidelberg 1987).
18. N. K. Vereshchagin, Relativizable and non-relativizable theorems in the polynomial theory of algorithms. Izvestija Rossijskoj Akademii Nauk 57,51 - 90 (1993). In Russian.
19. H. Vollmer, Uniform characterizations of complexity classes. Complexity Theory Column 23, ACM-SIGACT News 30, 17-27 (1999).
20. H. Vollmer and K. W. Wagner, Measure one results in computational complexity theory. In: Advances in Algorithms, Languages, and Complexity (D.-Z. Du and K.-I. Ko, eds.), pp. 285-312 (Kluwer Academic Publishers, 1997).