0:00 / 0:00
#pvsnp#computationalcomplexity#p=np
P vs. NP - The Biggest Unsolved Problem in Computer Science
Up and Atom
860K subscribers • 1 video on Hallway
- Recommended by 2 people: 2 in engineering communities.
- Presented by Jade
Beginner. No background in the topic needed.
1M views6 years ago2 recommendations
Computer scienceComputation and complexityAlgorithms
Jade explains the P vs. NP problem, computational complexity classes, and why it remains the biggest unsolved question in computer science.
Get a free audiobook and a 30-day trial of Audible (and support this channel) at audible.com/upandatom or text "upandatom" to 500 500 on your phone. Hi! I'm Jade. If you'd like to consider supporting Up and Atom, head over to my Patreon page :) patreon.com/upandatom Subscribe to Up and Atom for physics, math and computer science videos! youtube.com/c/upandatom Visit the Up and Atom Store store.nebula.app/collections/up-and-atom Computer Science Playlist youtube.com/playlist?list=PL1lNrW4e0G8V59k2acXxwwGHrBQoTYZS7 The Four Color Theorem youtu.be/42-ws3bkrKM The Halting Problem youtu.be/t37GQgUPa6k *Follow me* @upndatom Up and Atom on Twitter: twitter.com/upndatom?lang=en Up and Atom on Instagram: instagram.com/upndatom/ A big thank you to my AMAZING PATRONS! Bob, Purple Penguin, Damien J, Gadi Shalom, Chris Flynn, Ofer Mustigman, Mikely Whiplash, Sachin Shenoy, Yana Chernobilsky, Lynn Shackelford, Richard Farrer, Adam Thornton, Dag-Erling Smørgrav, Andrew Pann, Anne Tan, Joe Court, Brandon Combs, Damien Holloway, Ayan Doss, Marcus Dentrey, John Lakeman, Jana Christine Saout, Michael Dean, Chris Amaris, Daniel McGown, Matt G, Dafne Kiyui, Broos Nemanic, John Satchell, John Shioli, Todd Loreman, Susan Jones, Lou, Hassan Sedaghat, Alan McNea, S, Daniel Eliassen, Sam Ross, Julian Engel, Shawn, Israel Shirk, Kay, Peter Walsh, Osa and Beth Fitch, Garrett Chomka, Jeff Schwarz, Josh B, Zach Tinawi, Bernard Wei, Bobby Butler, Matt Harden, Rebecca Lashua, Pat Gunn, George Fletcher, Jasper Capel, Luc Ritchie, Elze Kool, Aditya Anantharaman, Frédéric Junod, Vincent Seguin, Paul Bryan, Michael Brunolli, Ken Takahashi, Jesse Clark, Steven Wheeler, Atila Pires dos Santos, Roger Johnson, Philip Freeman, Bogdan Morosanu, KhAnubis, Jareth Arnold, Simon Barker, Shawn Patrick James Kirby, Simon Tobar, Dennis Haupt, Renato Pereira, Simon Dargaville, and Magesh. For a one time donation, head over to my PayPal :) paypal.me/upandatomshows *Animations* Tom Groenestyn *Music* Epidemic SoundWhy it's here
2 people recommend thisWhat people say. Recommended as a clear and accessible introduction to the P vs. NP problem and computational complexity.
u/TotallyScrewtablein r/compsci • Recommends
P vs. NP - The Biggest Unsolved Problem in Computer Science (by Up and Atom)
u/aysz88in r/compsci • Mentions
On “Polynomial time?”
You can take inspiration from a few existing popsci-style explainers - these have 5-7-digit viewcounts, and you may want to look at not only the videos, but the comments below them for common pitfalls.
* link to this video is probably the most popular one, covering both the technical explanation (of what the problem is) to the profound implications (why P=?NP gets referenced a lot)
* link to this video
* link to this video
* link to this video