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
4,482,090 results
Hackerdashery #2 Inspired by the Complexity Zoo wiki: https://complexityzoo.uwaterloo.ca/Complexity_Zoo For more advanced ...
3,574,009 views
11 years ago
Are there limits to what computers can do? How complex is too complex for computation? The question of how hard a problem is ...
1,250,733 views
2 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,820 views
5 years ago
Lex Fridman Podcast full episode: https://www.youtube.com/watch?v=HUkBz-cdB-k Thank you for listening ❤ Check out our ...
63,978 views
6 months ago
Full episode with Richard Karp (Jul 2020): https://www.youtube.com/watch?v=KllCrlfLuzs Clips channel (Lex Clips): ...
63,722 views
Is there math in Nintendo games? Have mathematicians ever studied a Nintendo game? Surprisingly, the answer is yes! Thanks ...
105,793 views
8 months ago
Get a free audiobook and a 30-day trial of Audible (and support this channel) at http://www.audible.com/upandatom or text ...
989,555 views
Support us on Patreon: http://patreon.com/polylog What if we could run algorithms backwards? We discuss how we could do this ...
222,104 views
1 year ago
MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: http://ocw.mit.edu/6-046JS15 Instructor: ...
473,644 views
9 years ago
In this video, you'll get a comprehensive introduction to P and NP.
135,512 views
10 years ago
The 7 Millennium Prize Problems ($1 million prize). My goal is to make this topic accessible to everyone (or almost everyone ...
592,366 views
8 years ago
Le problème mathématique le plus difficile du monde ? Il parait que c'est l'hypothèse de Riemann... Il est question dans cette ...
739,174 views
A controversy has been stirring up the mathematical world in recent months: a scientist who must-not-be-named has announced ...
363,862 views
Est ce que l'on peut être un grand mathématicien si on est juste capable de dire qu'un raisonnement est correct? Voici ce qui peut ...
46,140 views
12 years ago
138,208 views
... was probably the most important catalyst in the explosion of interest in the study of NP-completeness and the P vs NP problem.
9,671 views
Did you know how to count cabbage triangulation, Catalan way ? Script/commentaries/FAQ/references : http://eljjdx.canalblog ...
315,240 views
Richard Karp, winner of the Association for Computing Machinery's A.M. Turing Award, explains his formulation of the P=NP ...
1,487 views
Get Nebula using my link for 40% off an annual subscription: https://go.nebula.tv/upandatom Watch my exclusive video on the SAT ...
506,525 views
What makes a problem "harder" than another problem? How can we say a problem is the hardest in a complexity class? In this ...
172,989 views
7 years ago
Stephen Cook, winner of the Association for Computing Machinery's A.M. Turing Award, explains why the question of whether ...
5,190 views
In this video, we discuss NP-hardness. If we solved any NP-hard problem in polynomial time, we could solve millions of problems ...
40,458 views
3 years ago
Nouvelle vidéo symbolique pour redémarrer cette chaîne YouTube après une longue absence dûe à...euh... *ahem* la flemme ...
11,047 views
This lecture is an informal introduction to the P=NP question in computer science: are nondeterministic polynomial time problems ...
20,269 views
4 years ago
P vs NP Satisfiability Reduction NP-Hard vs NP-Complete P=NP PATREON : https://www.patreon.com/bePatron?u=20475192 ...
2,522,216 views
This is my entry to #SoME4, Grant Sanderson's Summer of Math Exposition Competition! The P vs NP problem is widely agreed ...
245,235 views
7 months ago
A visual explanation of p vs. np and the difference between polynomial vs exponential growth. Dive deep into the enigma of ...
172,128 views
In this video, we learn that all decision problems that can be solved in polynomial time are in the complexity class P. And all ...
2,334 views
9,183 views
What if every hard problem could be solved in seconds? The P vs NP problem is one of the biggest unsolved mysteries in math ...
274 views
4 months ago
