Author:
Glaßer Christian,Hitchcock John M.,Pavan A.,Travers Stephen
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Agrawal, M.: Pseudo-random generators and structure of complete degrees. In: Proceedings of the 17th Annual IEEE Conference on Computational Complexity, pp. 139–145. IEEE Computer Society, Los Alamitos (2002)
2. Berman, L., Hartmanis, H.: On isomorphisms and density of NP and other complete sets. SIAM Journal on Computing 6(2), 305–322 (1977)
3. Even, S., Selman, A., Yacobi, Y.: The complexity of promise problems with applications to public-key cryptography. Information and Control 61(2), 159–173 (1984)
4. Fortnow, L., Lutz, J.H., Mayordomo, E.: Inseparability and strong hypotheses for disjoint NP pairs. In: Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics, vol. 5, pp. 395–404. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik (2010)
5. Lecture Notes in Computer Science;O. Goldreich,2006