Author:
Glaßer Christian,Selman Alan L.,Travers Stephen,Zhang Liyu
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Agrawal, M.: Pseudo-random generators and structure of complete degrees. In: IEEE Conference on Computational Complexity, pp. 139–147. IEEE Computer Society Press, Los Alamitos (2002)
2. Lecture Notes in Computer Science;K. Ambos-Spies,1984
3. Ambos-Spies, K., Fleischhack, H., Huwig, H.: Diagonalizations over polynomial time computable sets. Theoretical Computer Science 51, 177–204 (1987)
4. Beigel, R.: Query-Limited Reducibilities. PhD thesis, Stanford University (1987)
5. Beigel, R.: Relativized counting classes: Relations among thresholds, parity, mods. Journal of Computer and System Sciences 42, 76–96 (1991)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Non-Uniform Reductions;Theory of Computing Systems;2009-01-09
2. Space-Efficient Informational Redundancy;Algorithms and Computation;2008