Knowledge, Creativity and P versus NP
暂无分享,去创建一个
[1] F. Wiedijk. The Seventeen Provers of the World , 2006 .
[2] Avi Wigderson,et al. P , NP and mathematics – a computational complexity perspective , 2006 .
[3] Salil P. Vadhan,et al. Computational Complexity , 2005, Encyclopedia of Cryptography and Security.
[4] Oded Goldreich,et al. Modern Cryptography, Probabilistic Proofs and Pseudorandomness , 1998, Algorithms and Combinatorics.
[5] Russell Impagliazzo,et al. A personal view of average-case complexity , 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.
[6] Michael Sipser,et al. The history and status of the P versus NP question , 1992, STOC '92.
[7] Silvio Micali,et al. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.
[8] Eitan M. Gurari,et al. Introduction to the theory of computation , 1989 .
[9] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[10] A. Yao. How to generate and exchange secrets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[11] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..
[12] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[13] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.
[14] Richard M. Karp,et al. Reducibility among combinatorial problems" in complexity of computer computations , 1972 .
[15] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[16] Stephen A. Cook,et al. Review: Alan Cobham, Yehoshua Bar-Hillel, The Intrinsic Computational Difficulty of Functions , 1969 .
[17] J. M. Foster,et al. Mathematical theory of automata , 1965 .
[18] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics - Journal Canadien de Mathematiques.
[19] H. B. H.. The International Congress of Mathematicians , 1920, Nature.