Resource bounded randomness and weakly complete problems-Reference-Cited by-同舟云学术

Resource bounded randomness and weakly complete problems

Published:1994 Issue: Volume: Page:369-377
ISSN:0302-9743
Container-title:Algorithms and Computation
language:
Short-container-title:

Author:

Ambos-Spies Klaus,Terwijn Sebastiaan A.,Xizhong Zheng

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-58325-4_201.pdf

Reference13 articles.

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;

4. an extended abstract appears in the Proceedings of MFCS '94, Lecture Notes Comput. Sci., Springer Verlag).

5. 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).

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Resource bounded randomness and computational complexity;Theoretical Computer Science;2000-04

2. An Excursion to the Kolmogorov Random Strings;Journal of Computer and System Sciences;1997-06

3. Genericity and Randomness over Feasible Probability Measures;Advances in Algorithms, Languages, and Complexity;1997

4. Equivalence of measures of complexity classes;Lecture Notes in Computer Science;1997

5. Genericity and measure for exponential time;Theoretical Computer Science;1996-11