Reference37 articles.
1. E. Allender and R. Rubinstein, P-printable sets, SIAM J. Comput., to appear.
2. E. Allender and O. Watanabe, Kolmogorov complexity and degrees of tally sets, Proc. 3rd IEEE Conf. Structure in Complexity Theory, 1988, to appear.
3. K. Ambos-Spies, Randomness, relativizations and polynomial reducibilities, Proc. 1st Conf. Structure in Complexity Theory, LNCS 223, 1986, 23–34.
4. A. Amir and W. Gasarch, Polynomial terse sets, Proc. 2nd IEEE Conf. Structure in Complexity Theory, 1987, 22–27.
5. L. Babai, Trading group theory for randomness, Proc. 17th ACM Symp. Theory of Computing, 1985, 421–429.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献