proving p=np requires concepts we don't have | richard karp and lex fridman
Published 4 years ago • 36K plays • Length 2:50Download video MP4
Download video MP3
Similar videos
-
4:21
does p=np? | richard karp and lex fridman
-
3:19
can we prove p=np and not find the algorithm? | scott aaronson and lex fridman
-
3:58
what will the p=np proof look like? | cal newport and lex fridman
-
3:36
if p=np, you can break every encryption in the world | scott aaronson and lex fridman
-
2:07:33
richard karp: algorithms and computational complexity | lex fridman podcast #111
-
1:29:02
karl friston: neuroscience and the free energy principle | lex fridman podcast #99
-
4:53
lex fridman on russian language
-
1:25:25
16. complexity: p, np, np-completeness, reductions
-
4:31
can algorithms think? | richard karp and lex fridman
-
16:26
np-completeness | richard karp and lex fridman
-
6:33
the odds that p=np is 3% | scott aaronson and lex fridman
-
4:38
does p=np? | po-shen loh and lex fridman
-
10:55
can a hard problem be easy in practice? | richard karp and lex fridman
-
11:20
donald knuth: p=np | ai podcast clips
-
13:12
randomized algorithms | richard karp and lex fridman
-
4:42
what are combinatorial algorithms? | richard karp and lex fridman
-
5:27
the most beautiful algorithm | richard karp and lex fridman
-
7:47
cal newport - what will the p=np proof look like | lex fridman podcast
-
7:41
karp on the definition of p and np.
-
2:49:42
robert proctor: nazi science and ideology | lex fridman podcast #268
-
0:31
joe rogan humiliates lex fridman
-
3:10:50
charan ranganath: human memory, imagination, deja vu, and false memories | lex fridman podcast #430