Author:
Glaßer Christian,Selman Alan L.,Travers Stephen,Wagner Klaus W.
Publisher
Springer Berlin Heidelberg
Reference24 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. Blass, A., Gurevich, Y.: On the unique satisfiability problem. Information and Control 82, 80–88 (1982)
4. Berman, L., Hartmanis, J.: On isomorphism and density of NP and other complete sets. SIAM Journal on Computing 6, 305–322 (1977)
5. Buhrman, H., Hoene, A., Torenvliet, L.: Splittings, robustness, and structure of complete sets. SIAM Journal on Computing 27, 637–653 (1998)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献