Description
简单讲讲P vs NP问题
文案：@苍穹玥夜
口播：@非村科普墙
协力：@silverxz
参考文献：
[1] R. Impagliazzo, ”A personal view of average-case complexity,” Proceedings of Structurein Complexity Theory. Tenth Annual IEEE Conference, Minneapolis, MN, USA, 1995,pp. 134-147, doi: 10.1109/SCT.1995.514853.
[2] Lance Fortnow. 2021. Fifty years of P vs. NP and the possibility of the impossible.Commun. ACM 65, 1 (January 2022), 76–85. https://doi.org/10.1145/3460351
[3] Fortnow L. The status of the P versus NP problem[J]. Communications of the ACM,2009, 52(9): 78-86.
[4] Agrawal, Manindra, et al. “PRIMES Is in P.” Annals of Mathematics, vol. 160, no. 2,2004, pp. 781–93. JSTOR, http://www.jstor.org/stable/3597229. Accessed 18 Mar. 2025.
[5] Case M. A beginner’s guide to the general number field sieve[J]. Oregon State University,ECE575 Data Security and Cryptography Project, 2003.
[6] Sipser. (2021). Introduction to the Theory of Computation (Third edition). CengageLearning.
