ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

303,278 results

Related queries

computational complexity theory

3 sat problem

halting problem

millennium prize problems

polynomial time reduction

np completeness proof

hodge conjecture

clique problem

hackerdashery
P vs. NP and the Computational Complexity Zoo

Hackerdashery #2 Inspired by the Complexity Zoo wiki: https://complexityzoo.uwaterloo.ca/Complexity_Zoo For more advanced ...

10:44
P vs. NP and the Computational Complexity Zoo

3,553,162 views

11 years ago

Quanta Magazine
Biggest Puzzle in Computer Science: P vs. NP

Are there limits to what computers can do? How complex is too complex for computation? The question of how hard a problem is ...

19:44
Biggest Puzzle in Computer Science: P vs. NP

1,193,014 views

1 year ago

Up and Atom
P vs. NP - The Biggest Unsolved Problem in Computer Science

Get a free audiobook and a 30-day trial of Audible (and support this channel) at http://www.audible.com/upandatom or text ...

15:33
P vs. NP - The Biggest Unsolved Problem in Computer Science

984,818 views

5 years ago

Lex Clips
Proving P=NP Requires Concepts We Don't Have | Richard Karp and Lex Fridman

... was probably the most important catalyst in the explosion of interest in the study of NP-completeness and the P vs NP problem.

2:50
Proving P=NP Requires Concepts We Don't Have | Richard Karp and Lex Fridman

61,860 views

5 years ago

Lex Clips
Terence Tao on P=NP problem | Lex Fridman Podcast Clips

Lex Fridman Podcast full episode: https://www.youtube.com/watch?v=HUkBz-cdB-k Thank you for listening ❤ Check out our ...

3:16
Terence Tao on P=NP problem | Lex Fridman Podcast Clips

60,627 views

4 months ago

MATH+ The Berlin Mathematics Research Center
Das Millennium-Problem „P versus NP“ – Eines der sieben größten Abenteuer der Mathematik

(For English description, see below) Von Frühjahr bis Herbst 2022 lief die bundesweite Veranstaltungsreihe „Die 7 größten ...

1:48
Das Millennium-Problem „P versus NP“ – Eines der sieben größten Abenteuer der Mathematik

14,511 views

3 years ago

Undefined Behavior
P vs. NP - An Introduction

P vs. NP is one of the greatest unsolved problems. Just what is it, and why is it so important? Created by: Cory Chang Produced ...

10:10
P vs. NP - An Introduction

246,866 views

8 years ago

People also watched

Weitz / HAW Hamburg
Das P-NP-Problem

Das GANZ NEUE Buch: http://weitz.de/GDM/ Das NEUE Buch: http://weitz.de/PP/ Im Playlist-Kontext: ...

25:46
Das P-NP-Problem

7,968 views

8 years ago

المصباح العلمي
مسألة المليون دولار 💰🤯: P ضد NP !

تنويه: الرجاء عند مشاهدة إعلان يخالف مبادءك الأخلاقية أو الدينية إرسال الرابط الذي يؤدي إليه على هذا الإيميل ...

15:15
مسألة المليون دولار 💰🤯: P ضد NP !

73,835 views

2 years ago

ARTEde
Die Poincaré-Vermutung | Mathewelten | ARTE

Ein Kreis ist auch ein Dreieck und ein Dreieck ein Viereck. Unmöglich? In der Topologie schon, und das funktioniert sogar im ...

9:53
Die Poincaré-Vermutung | Mathewelten | ARTE

1,018,159 views

4 years ago

Lex Clips
NP-Completeness | Richard Karp and Lex Fridman

... was probably the most important catalyst in the explosion of interest in the study of NP-completeness and the P vs NP problem.

16:26
NP-Completeness | Richard Karp and Lex Fridman

9,442 views

5 years ago

Lex Clips
Can we prove P=NP and not find the algorithm? | Scott Aaronson and Lex Fridman

Lex Fridman Podcast full episode: https://www.youtube.com/watch?v=nAMjv0NAESM Please support this podcast by checking out ...

3:19
Can we prove P=NP and not find the algorithm? | Scott Aaronson and Lex Fridman

10,575 views

5 years ago

Lex Clips
Does P=NP? | Po-Shen Loh and Lex Fridman

Lex Fridman Podcast full episode: https://www.youtube.com/watch?v=6z1JwZbX4dQ Please support this podcast by checking out ...

4:38
Does P=NP? | Po-Shen Loh and Lex Fridman

22,534 views

4 years ago

MIT OpenCourseWare
14. P and NP, SAT, Poly-Time Reducibility

Showed that COMPOSITES is in NP. Discussed the P versus NP question. Proved that acceptance problem for CFG is in P.

1:19:23
14. P and NP, SAT, Poly-Time Reducibility

36,076 views

4 years ago

Wandida, EPFL
P versus NP : exemple dans un réseau social | Rachid Guerraoui

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 ...

9:54
P versus NP : exemple dans un réseau social | Rachid Guerraoui

46,040 views

12 years ago

Richard E Borcherds
P=NP?

This lecture is an informal introduction to the P=NP question in computer science: are nondeterministic polynomial time problems ...

39:33
P=NP?

19,942 views

4 years ago

Simons Institute for the Theory of Computing
Beyond Computation: The P versus NP question

Michael Sipser, Massachusetts Institute of Technology http://simons.berkeley.edu/events/michael-sipser.

54:51
Beyond Computation: The P versus NP question

5,809 views

11 years ago

PurpleMind
Computer Science's Biggest Mystery | P vs NP #SoME4

This is my entry to #SoME4, Grant Sanderson's Summer of Math Exposition Competition! The P vs NP problem is widely agreed ...

22:29
Computer Science's Biggest Mystery | P vs NP #SoME4

242,290 views

4 months ago

MIT OpenCourseWare
16. Complexity: P, NP, NP-completeness, Reductions

MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: http://ocw.mit.edu/6-046JS15 Instructor: ...

1:25:25
16. Complexity: P, NP, NP-completeness, Reductions

460,551 views

9 years ago

Channels new to you

Newbie Indie Game Dev
Mario is (NP-) Hard

0:00​ The Problem 0:59​ Complexity Classes 3:06​ P vs NP 3:59​ Super Mario Bros. is NP-hard 4:49​ 3SAT 6:16​ Proof: ...

9:47
Mario is (NP-) Hard

115,675 views

3 months ago

Udacity
P and NP - Georgia Tech - Computability, Complexity, Theory: Complexity

In this video, you'll get a comprehensive introduction to P and NP.

2:03
P and NP - Georgia Tech - Computability, Complexity, Theory: Complexity

132,758 views

10 years ago

Turing Awardee Clips
Cook explains  why P=NP matters.

Stephen Cook, winner of the Association for Computing Machinery's A.M. Turing Award, explains why the question of whether ...

1:04
Cook explains why P=NP matters.

4,720 views

5 years ago

Udacity
Should You Try To Solve P Vs NP? - Intro to Theoretical Computer Science

This video is part of an online course, Intro to Theoretical Computer Science. Check out the course here: ...

2:35
Should You Try To Solve P Vs NP? - Intro to Theoretical Computer Science

42,160 views

10 years ago

Lex Clips
Does P=NP? | Richard Karp and Lex Fridman

... was probably the most important catalyst in the explosion of interest in the study of NP-completeness and the P vs NP problem.

4:21
Does P=NP? | Richard Karp and Lex Fridman

9,034 views

5 years ago

Art of the Problem
P = NP? | Complexity Theory Explained Visually

A visual explanation of p vs. np and the difference between polynomial vs exponential growth. Dive deep into the enigma of ...

11:16
P = NP? | Complexity Theory Explained Visually

170,015 views

8 years ago

Polylog
What P vs NP is actually about

Support us on Patreon: http://patreon.com/polylog What if we could run algorithms backwards? We discuss how we could do this ...

17:58
What P vs NP is actually about

216,021 views

1 year ago

Statistical Machine Learning
Stephen Cook on P vs NP

Algorithmic complexity master Stephen Cook gives his take on whether P is equal to NP.

1:38
Stephen Cook on P vs NP

3,538 views

3 years ago

The Morpheus Tutorials
$1 Million Question: P vs. NP in Computer Science

One of the most important and oldest questions in computer science is the so-called "P vs NP" problem. _Learn computer ...

14:26
$1 Million Question: P vs. NP in Computer Science

15,484 views

2 years ago

Lex Clips
What will the P=NP proof look like? | Cal Newport and Lex Fridman

Lex Fridman Podcast full episode: https://www.youtube.com/watch?v=y3Umo_jd5AA Please support this podcast by checking out ...

3:58
What will the P=NP proof look like? | Cal Newport and Lex Fridman

17,996 views

4 years ago

Institute for Advanced Study
The "P vs. NP" Problem: Efficient Computation....Knowledge" - Avi Wigderson

Avi Wigderson Institute for Advanced Study October 24, 2008 The "P vs. NP" problem is a central outstanding problem of computer ...

57:52
The "P vs. NP" Problem: Efficient Computation....Knowledge" - Avi Wigderson

4,850 views

9 years ago

Lex Clips
If P=NP, you can break every encryption in the world | Scott Aaronson and Lex Fridman

Lex Fridman Podcast full episode: https://www.youtube.com/watch?v=nAMjv0NAESM Please support this podcast by checking out ...

3:36
If P=NP, you can break every encryption in the world | Scott Aaronson and Lex Fridman

14,241 views

5 years ago