P=NP? @richarde.borcherds7998
P=NP?  @richarde.borcherds7998
Uploaded January 2021 | Updated November 2026, 3 hours ago
This lecture is an informal introduction to the P=NP question in computer science: are nondeterministic polynomial time problems (NP) the same as polynomial time problems (P)? We describe what these terms mean, give a brief history, and examine some of the arguments for and against this question.

The obfuscated C contest mentioned in the video can be found here: ioccc.org

The book mentioned is "Computers and intractability A guide to the theory of NP-completeness" by Michael R. Garey and David S. Johnson, which is recommended for further reading.

Correction: Kyla should be Kayal (in the Agrawal-Kayal-Saxena primality test).
P=NP?Theory of numbers: RSA cryptographyIntroduction to number theory lecture 39: Equivalence of binary quadratic formsIntroduction to number theory lecture 24. Primitive roots for prime powersRings 9 Projective modulesAlgebraic topology: Calculating the fundamental groupComplex analysis: ArithmeticTheory of numbers: Quadratic reciprocityModular forms: Product formula for jTheory of numbers: Fermats theoremDedekind domains: IntroductionLie groups: Baker Campbell Hausdorff formula
Richard E Borcherds |

P=NP?

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER