pnp.pdf
scottaaronson.com · 10,420 words · saved by 1 readers
N/A
? P = NP Scott Aaronson∗ Abstract In 1955, John Nash sent a remarkable letter to the National Security Agency, in which— seeking to build theoretical foundations for cryptography—he all but formulated what today ? we call the P = NP problem, considered one of the great open problems of science. Here I survey the status of this problem in 2017, for a broad audience of mathematicians, scientists,…
saved by
related reading
- P versus NP problem - Wikipediaen.wikipedia.org
- Reasons to believescottaaronson.blog
- P vs. NP for Dummiesscottaaronson.blog
- I believe P=NPemanueleviola.wordpress.com
- aaronson-philosophy.pdfcs.princeton.edu
- P vs NP and its application to zero knowledge proofs | RareSkillsrareskills.io
- Napkin.pdfvenhance.github.io
- P vs. NP and the Computational Complexity Zooyoutube.com
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- NP-completeness - Wikipediaen.wikipedia.org
- Shtetl-Optimized >> Blog Archive >> Ten Signs a Claimed Mathematical Breakthrough is Wrongscottaaronson.blog
- What P vs NP is actually about – Vasek Rozhon's blogvasekrozhon.wordpress.com