Genericity and measure for exponential time

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

Volumn 841 LNCS, Issue , 1994, Pages 221-232

  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

POLYNOMIAL APPROXIMATION;

EXPONENTIAL TIME; GENERICITY; LEBESGUE MEASURE; POLYNOMIAL-TIME; QUANTITATIVE STRUCTURES; QUERY REDUCTIONS; SMALL SPAN THEOREM;

C (PROGRAMMING LANGUAGE);

EID: 0345777659     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58338-6_69     Document Type: Conference Paper

References (22)

1. K. Ambos-Spies, Randomness, relativizations, and polynomial reducibilities, in: Proc. First Structure in Complexity Theory Conference 1986, Lect. Notes Comput. Sci. 223 (1986) 23–34.
2. K. Ambos-Spies, H. Fleischhack, and H. Huwig, Diagonalizations over polynomial time computable sets, Theor. 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. 329 (1988) 1–16.
4. K. Ambos-Spies, S. A. Terwijn, X. Zheng, Resource bounded randomness and weakly complete problems (in preparation; a preliminary report is submitted)
5. J. L. Balcazar and U. Schöning. Bi-immune sets for complexity classes, Math. Systems Theory 18 (1985) 1–10.
6. C. H. Bennett and J. Gill, relative to a random oracle A, PA≠NPA≠co-NPA with probability 1, SIAM J. Comput. 10 (1981) 96–113.
7. H. Fleischhack, On Diagonalizations over Complexity Classes, Dissertation, Universität Dortmund, Dept. Comput. Sci. Tech. Rep. 210, 1985.
8. H. Fleischhack, P-genericity and strong P-genericity, in: Proc. MFCS 1986, Lect. Notes Comput. Sci. 233 (1986) 341–349.
9. H. Heller, On relativized exponential and probabilistic complexity classes, Information and Control 71 (1986) 231–243.
10. C. Jockusch, Degrees of generic sets, in: Recursion Theory: its Generalisations and Applications, London Math. Soc. Lect. Notes Series 45 (1980) 110–139, Cambridge University Press.
11. D. W. Juedes and J. H. Lutz, The complexity and distribution of hard problems, Tech. Rep. 92-23, Dept. Comput. Sci., Iowa State University. 1992 (submitted for publication).
12. R. E. Ladner, N. A. Lynch and A. L. Selman, A comparison of polynomial time reduciblities, Theor. Comput. Sc. 1 (1975) 103–123.
13. W. Lindner, On the polynomial time bounded measure of one-truth-table degrees and p-selectivity, Diplomarbeit, Technische Universität Berlin, 1993.
14. J. H. Lutz, Category and measure in complexity classes, SIAM J. Comput. 19 (1990) 1100–1131.
15. J. H. Lutz, Almost everywhere high nonuniform complexity, J. Comput. System Sci. 44 (1992) 220–258.
16. J. H. Lutz, The quantitative structure of exponential time, in: Proc. 8th Structure in Complexity Theory Conference, 1993, 158–175, IEEE Coput. Sci. Press.
17. J. H. Lutz and E. Mayordomo, Measure, stochasticity, and the density of hard languages, SIAM J. Comput. (to appear).
18. J. H. Lutz and E. Mayordomo, Cook versus Karp-Levin: Separating completeness notions if NP is not small. Tech. Rep. 92-24, Dept. Comput. Sci., Iowa State University. 1992. [Extended Abstract in: Proc. STACS 94, Lect. Notes Comput. Sci. 775 (1994) 415–426.
19. P. Martin-Löf, The definition of random sequences, Information and Control 9 (1966) 602–619.
20. E. Mayordomo, Almost every set in exponential time is P-bi-immune, in: Proc. MFCS 1992, Lect. Notes Comput. Sci. 629 (1992) 392–400.
21. C. P. Schnorr, Zufälligkeit und Wahrscheinlichkeit, Lect. Notes Mathematics 218, 1971.
22. S. Tang and R. Book, Polynomial-time reducibilities and “almost all” oracle sets, Theor. Comput. Sci 81 (1991) 35–47.