NP-COMPLETENESS, a conceptual understanding

From the creator

Get Nebula using my link for 40% off an annual subscription: https://go.nebula.tv/upandatom Watch my exclusive video on the SAT to clique reduction: https://nebula.tv/videos/upandatom-sat-to-clique-reduction-bonus-video-from-npcompleteness Hi! I'm Jade. If you'd like to consider supporting Up and Atom, head over to my Patreon page :) https://www.patreon.com/upandatom Visit the Up and Atom store https://store.nebula.app/collections/up-and-atom Subscribe to Up and Atom for physics, math and computer science videos https://www.youtube.com/c/upandatom For a one time donation, head over to my PayPal :) https://www.paypal.me/upandatomshows *Videos Mentioned* Turing Machines https://youtu.be/PLVCscCY4xI P vs NP https://youtu.be/EHp4FPyajKQ Deep dives into the Cook-Levin Theorem https://youtu.be/6Az1gtDRaAU https://youtu.be/LW_37i96htQ *Sources and Further Reading* The complexity of theorem proving procedures - Stephen Cook Universal search problems - Leonid Levin Reducibility Among Combinatorial Problems - Richard Karp The Nature of Computation - Christopher Moore *A big thank you to my AMAZING PATRONS!* Jonathan Koppelman, Michael Seydel, Cy 'kkm' K'Nelson, Thorsten Auth, Tim Barnard, AndrewA, Izzy Ca, Millennial Glacier, Richard O McEwen Jr, Scott Ready, John H. Austin, Jr., Brian Wilkins, Thomas V Lohmeier, David Johnston, Thomas Krause, Lynn Shackelford, Ave Eva Thornton, Andrew Pann, Anne Tan, Larry Nixon, Ben Mitchell, Steve Archer, Luna Sophia, Viktor Lazarevich,

Published 2023-03-31 · Watch on YouTube ↗
Availability and playback restrictions are controlled by the original channel.