Genericity and measure for exponential time

Theoretical Computer Science

Volumn 168, Issue 1, 1996, Pages 3-19

  Ambos Spies, Klaus ^a   Neis, Hans Christian ^b   Terwijn, Sebastiaan A ^c  

^a UNIVERSITY OF HEIDELBERG   (Germany)

^b UNIVERSITY OF FREIBURG   (Germany)

^c UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIALS; THEOREM PROVING;

EXPONENTIAL TIME; GENERALIZATION; LEBESGUE MEASURE;

COMPUTATIONAL COMPLEXITY;

EID: 0030289312     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(96)89424-2     Document Type: Article

References (23)

1. K. Ambos-Spies, Randomness, relativizations, and polynomial reducibilities, in: Proc. First Structure in Complexity Theory Conf. 1986, Lect. Notes Comput. Sci., Vol. 223 (Springer, Berlin, 1986) 23-34.
2. K. Ambos-Spies, H. Fleischhack and H. Huwig, Diagonalizations over polynomial time computable sets, Theoret. Comput. Sci. 51 (1987) 177-204.
3. K. Ambos-Spies, H. Fleischhack and H. Huwig, Diagonalizing over deterministic polynomial time, in: Proc. CSL '87, Lect. Notes Comput. Sci., Vol. 329 (Springer, Berlin, 1988) 1-16.
4. K. Ambos-Spies, S.A. Terwijn and X. Zheng, Resource bounded randomness and weakly complete problems, Theort. Comput. Sci., to appear; (Extended abstract in: Proc. ISAAC '94, Lect. Notes Comput. Sci., Vol. 834 (Springer, Berlin, 1994) 369-377.)
5. K. Ambos-Spies, S.A. Terwijn and X. Zheng, Resource bounded randomness and weakly complete problems, Theort. Comput. Sci., to appear; (Extended abstract in: Proc. ISAAC '94, Lect. Notes Comput. Sci., Vol. 834 (Springer, Berlin, 1994) 369-377.)
6. J.L. Balcazar and U. Schöning, Bi-immune sets for complexity classes, Math. Systems Theory 18 (1985) 1-10.
7. A with probability 1, SIAM J. Comput. 10 (1981) 96-113.
8. H. Fleischhack, On diagonalizations over complexity classes, Dissertation, Universität Dortmund, Dept. Comput. Sci. Tech. Rep. 210, 1985.
9. H. Fleischhack, P-genericity and strong P-genericity, in: Proc. MFCS 1986, Lect. Notes Comput. Sci., Vol. 233 (Springer, Berlin, 1986) 341-349.
10. H. Heller, On relativized exponential and probabilistic complexity classes, Inform. and Control 71 (1986) 231-243.
11. C. Jockusch, Degrees of generic sets, in: Recursion Theory: its Generalisations and Applications, London Math. Soc. Lect. Notes Series, Vol. 45 (Cambridge University Press, Cambridge, 1980) 110-139.
12. D.W. Juedes and J.H. Lutz, The complexity and distribution of hard problems, SIAM J. Comput. 24 (1995) 279-295.
13. R.E. Ladner, N.A. Lynch and A.L. Selman, A comparison of polynomial time reducibilities. Theoret Comput. Sci. 1 (1975) 103-123.
14. W. Lindner, On the polynomial time bounded measure of one-truth-table degrees and p-selectivity, Diplomarbeit, Technische Universität Berlin, 1993.
15. J.H. Lutz, Category and measure in complexity classes, SIAM J. Comput. 19 (1990) 1100-1131.
16. J.H. Lutz, Almost everywhere high nonuniform complexity, J. Comput. System Sci. 44 (1992) 220-258.
17. J.H. Lutz, The quantitative structure of exponential time, in: Proc. 8th Structure in Complexity Theory Conf. (IEEE Comput. Soc. Press, New York, 1993) 158-175.
18. J.H. Lutz and E. Mayordomo, Measure, stochasticity, and the density of hard languages, SIAM J. Comput. 23 (1994) 762-779.
19. J.H. Lutz and E. Mayordomo, Cook versus Karp-Levin: Separating completeness notions if NP is not small, Theoret. Comput. Sci. 164 (1996) 141-146.
20. P. Martin-Löf, The definition of random sequences, Inform. and Control 9 (1966) 602-619.
21. E. Mayordomo, Almost every set in exponential time is P-bi-immune. Theoret. Comput. Sci. 136 (1994) 487-506.
22. C.P. Schnorr, Zufälligkeit und Wahrscheinlichkeit, Lect. Notes Mathematics, Vol. 218 (Springer, Berlin, 1971).
23. S. Tang and R. Book, Polynomial-time reducibilities and "almost all" oracle sets, Theoret. Comput. Sci. 81 (1991) 35-47.