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
9,193,467 results
computational complexity theory
3 sat problem
np completeness tamil
polynomial time reduction
np hard graph problems
np completeness proof
Hackerdashery #2 Inspired by the Complexity Zoo wiki: https://complexityzoo.uwaterloo.ca/Complexity_Zoo For more advanced ...
3,571,845 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,588 views
7 years ago
P vs NP Satisfiability Reduction NP-Hard vs NP-Complete P=NP PATREON : https://www.patreon.com/bePatron?u=20475192 ...
2,513,770 views
MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: http://ocw.mit.edu/6-046JS15 Instructor: ...
472,627 views
9 years ago
... P problems explained 09:56 Exponential NP Problems explained 11:36 Implications if P = NP 12:48 Discovery of NP Complete ...
1,243,859 views
2 years ago
In this video, we discuss NP-hardness. If we solved any NP-hard problem in polynomial time, we could solve millions of problems ...
40,216 views
3 years ago
138,032 views
Full episode with Richard Karp (Jul 2020): https://www.youtube.com/watch?v=KllCrlfLuzs Clips channel (Lex Clips): ...
63,544 views
5 years ago
MIT 18.404J Theory of Computation, Fall 2020 Instructor: Michael Sipser View the complete course: ...
33,860 views
4 years ago
Richard Karp, moderator, UC Berkeley Ron Fagin, IBM Almaden Russell Impagliazzo, UC San Diego Sandy Irani, UC Irvine ...
28,639 views
Lex Fridman Podcast full episode: https://www.youtube.com/watch?v=nAMjv0NAESM Please support this podcast by checking out ...
54,714 views
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 ...
908,845 views
MIT 6.890 Algorithmic Lower Bounds: Fun with Hardness Proofs, Fall 2014 View the complete course: http://ocw.mit.edu/6-890F14 ...
43,495 views
10 years ago
All rights reserved for http://www.aduni.org/ Published under the Creative Commons Attribution-ShareAlike license ...
60,928 views
13 years ago
Table of Contents: 00:00 - SAT Reduces to 3-Coloring 00:59 - Circuit SAT 02:21 - Circuit SAT 02:39 - Truth Colors 03:59 - simulate ...
34,741 views
8 years ago
Topic 24 C: NP Complete Problems We illustrate the range of NP Complete problems and how they are shown to be NPC by ...
51,545 views
12 years ago
MIT 6.006 Introduction to Algorithms, Fall 2011 View the complete course: http://ocw.mit.edu/6-006F11 Instructor: Erik Demaine ...
535,383 views
Alan Turing almost accidentally created the blueprint for the modern day digital computer. Here Mark Jago takes us through The ...
897,949 views
SAT (and SMT) solvers have had much success in the formal methods communities. While production solvers are large and highly ...
48,047 views
Support us on Patreon: http://patreon.com/polylog What if we could run algorithms backwards? We discuss how we could do this ...
221,404 views
1 year ago
Here we introduce a "polynomial-time reduction," which is one in which takes polynomial time (obviously). We also introduce the ...
70,347 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,029 views
Join the Newbie Nexus on Discord: https://discord.gg/CkWXnH9utV ⭐ Support on Patreon: ...
119,590 views
5 months ago
In this video, you'll get a comprehensive introduction to P and NP.
135,199 views
Watch on Udacity: https://www.udacity.com/course/viewer#!/c-ud061/l-3474368615/m-2468098571 Check out the full Advanced ...
3,331 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 ...
968 views
Here we show that the directed hamiltonian path problem is NP-complete by showing it is in NP and is NP-hard via a ...
46,572 views
9,643 views
