Author:
Glaßer Christian,Selman Alan L.,Travers Stephen,Zhang Liyu
Subject
General Computer Science,Theoretical Computer Science
Reference20 articles.
1. M. Agrawal, Pseudo-random generators and structure of complete degrees, in: IEEE Conference on Computational Complexity, 2002, pp. 139–147
2. P-mitotic sets;Ambos-Spies,1984
3. Diagonalizations over polynomial time computable sets;Ambos-Spies;Theoretical Computer Science,1987
4. J. Balcazar, E. Mayordomo, A note on genericity and bi-immunity, in: Proceedings of the Tenth Annual IEEE Conference on Computational Complexity, 1995, pp. 193–196
5. R. Beigel, Query-limited reducibilities, Ph.D. Thesis, Stanford University, 1987
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献