Resource bounded randomness and weakly complete problems

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

Volumn 834 LNCS, Issue , 1994, Pages 369-377

  Ambos Spies, Klaus ^a   Terwijn, Sebastiaan A ^b   Xizhong, Zheng ^c  

^a UNIVERSITY OF HEIDELBERG   (Germany)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

^c NANJING UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; RANDOM PROCESSES; SET THEORY;

COMPLETE PROBLEMS; COMPLETE SETS; GENERICITY; POLYNOMIAL-TIME; RANDOM SET; RESOURCE-BOUNDED; RESOURCE-BOUNDED MEASURE;

C (PROGRAMMING LANGUAGE);

EID: 84948127733     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58325-4_201     Document Type: Conference Paper

References (12)

1. K. Ambos-Spies, H. Fleischhack, and H. Huwig, Diagonalizations over polynomial time computable sets, Theor. Comput. Sci. 51 (1987) 177-204.
2. K. Ambos-Spies, H. Fleischhack, and H. Huwig, Diagonalizing over deterministic polynomial time, in: Proc. CSL '87, Lecture Notes Comput. Sci. 329 (1988) 1-16, Springer Verlag.
3. K. Ambos-Spies, H-C. Neis, and S. A. Terwijn, Genericity and measure for exponential time, (in preparation; an extended abstract appears in the Proceedings of MFCS '94, Lecture Notes Comput. Sci., Springer Verlag).
4. 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).
5. J. H. Lutz, Category and measure in complexity classes SIAM J. Comput. 19 (1990) 1100-1131.
6. J. H. Lutz, Almost everywhere high nonuniform complexity, J. Comp. System Sci. 44 (1992) 220-258.
7. J. H. Lutz, The quantative structure of exponential time in: Proc. 8th Structure in Complexity Theory Conference (1993) 158-175, IEEE Comput. Sci. Press.
8. J. H. Lutz, Weakly hard problems, (preliminary version, April 1993, submitted for publication; extended abstract to appear in Proc. 9th Structure in Complexity Theory Conference, 1994).
9. J. H. Lutz and E. Mayordomo, Measure, stochasticity, and the density of hard languages, (to appear in SIAM J. Comput.).
10. P. Martin-Löf, The definition of random sequences, Information and Control 9 (1966) 602-619.
11. P. Orponen and U. Schöning, The density and complexity of polynomial cores for intractable sets, Information and Control 70 (1986) 54-68.
12. C. P. Schnorr, Zufälligkeit und Wahrscheinlichkeit, Lect. Notes Math. 218 (1971), Springer Verlag.