Upload date
All time
Last hour
Today
This week
This month
This year
Type
All
Video
Channel
Playlist
Movie
Duration
Short (< 4 minutes)
Medium (4-20 minutes)
Long (> 20 minutes)
Sort by
Relevance
Rating
View count
Features
HD
Subtitles/CC
Creative Commons
3D
Live
4K
360°
VR180
HDR
1,200,740 results
P vs NP Satisfiability Reduction NP-Hard vs NP-Complete P=NP PATREON : https://www.patreon.com/bePatron?u=20475192 ...
2,518,913 views
7 years ago
Hackerdashery #2 Inspired by the Complexity Zoo wiki: https://complexityzoo.uwaterloo.ca/Complexity_Zoo For more advanced ...
3,573,030 views
11 years ago
What makes a problem "harder" than another problem? How can we say a problem is the hardest in a complexity class? In this ...
172,810 views
... NP Problems explained 11:36 Implications if P = NP 12:48 Discovery of NP Complete problems 13:45 Knapsack Problem and ...
1,247,759 views
2 years ago
MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: http://ocw.mit.edu/6-046JS15 Instructor: ...
473,170 views
9 years ago
If we solved any NP-hard problem in polynomial time, we could solve millions of problems in NP in polynomial time. NP-complete ...
40,351 views
3 years ago
138,130 views
In this video, you'll get a comprehensive introduction to P and NP.
135,377 views
10 years ago
On parle d'un problème d'informatique théorique à 1 million de dollars, et même beaucoup plus si vous l'utilisez pour pirater les ...
909,518 views
5 years ago
Join us at - https://discord.com/invite/n8vHbE29tN More videos ...
471,299 views
1 year ago
We now have a Tumblr: Tumblr: http://numberphile.tumblr.com This paper on ebay: http://www.ebay.co.uk/itm/221197137799 ...
6,481,544 views
12 years ago
Lex Fridman Podcast full episode: https://www.youtube.com/watch?v=nAMjv0NAESM Please support this podcast by checking out ...
10,790 views
54,751 views
Alan Turing almost accidentally created the blueprint for the modern day digital computer. Here Mark Jago takes us through The ...
898,257 views
... important um NP complete problems for no other reason than it's than its application to many many real world problems and so ...
5,879 views
... Srinivas Devadas In this lecture, Professor Devadas introduces approximation algorithms in the context of NP-hard problems.
91,424 views
140,132 views
MIT 6.890 Algorithmic Lower Bounds: Fun with Hardness Proofs, Fall 2014 View the complete course: http://ocw.mit.edu/6-890F14 ...
43,526 views
MIT 18.404J Theory of Computation, Fall 2020 Instructor: Michael Sipser View the complete course: ...
33,976 views
4 years ago
Full episode with Richard Karp (Jul 2020): https://www.youtube.com/watch?v=KllCrlfLuzs Clips channel (Lex Clips): ...
9,658 views
Get a free audiobook and a 30-day trial of Audible (and support this channel) at http://www.audible.com/upandatom or text ...
989,288 views
In this video we discuss the idea of NP problems with the classic travelling salesman problem. We comment on the difficulty of the ...
35,193 views
Support us on Patreon: http://patreon.com/polylog What if we could run algorithms backwards? We discuss how we could do this ...
221,805 views
63,649 views
In this episode, Dr. Know-it-all follows up on his previous P vs. NP video. This time he delves into how to do a "good enough" job ...
974 views
Here we introduce a "polynomial-time reduction," which is one in which takes polynomial time (obviously). We also introduce the ...
70,574 views
