The P versus NP Problem (Part 8)

preview_player
Показать описание
This video is the eigth in a multi-part series on the P versus NP problem geared for a broad audience (i.e., one with a very basic understanding of mathematics and computer science). In this eighth video I introduce (in an intuitive sense) the notion of NP Completeness -- which helps us understand the structure of NP.
My goal is to do a full series on the P versus NP problem , so you may wish to subscribe to the channel if you want to see all the videos in this series.
  1. brainsetmanus
Рекомендации по теме
Biggest Puzzle in 0:19:44

Biggest Puzzle in Computer Science: P vs. NP

P vs. NP 0:10:44

P vs. NP and the Computational Complexity Zoo

P vs. NP 0:15:33

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

P vs. NP 0:10:10

P vs. NP - An Introduction

Proving P=NP Requires 0:02:50

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

P vs NP 0:01:11

P vs NP problem explained simply ✍️ #history #maths #mathematics #science

What P vs 0:17:58

What P vs NP is actually about

Unlocking the Mystery 0:00:20

Unlocking the Mystery of P vs NP: Implications for Future Technology

What is Class 0:04:48

What is Class P? | P vs NP | Cobham Edmonds Thesis | Complexity Theory | L2 | TOC | BTech Bestiee

P and NP 0:02:03

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

The Shortest Math 0:07:49

The Shortest Math Problem No One Can Solve - P vs NP

What is the 0:07:35

What is the P vs NP Problem?

8. NP-Hard and 0:31:53

8. NP-Hard and NP-Complete Problems

Should You Try 0:02:35

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

What will the 0:03:58

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

The Secret Link 0:33:03

The Secret Link Between Thousands of Unsolved Math Problems (NP-Completeness)

Professor Avi Wigderson 0:57:24

Professor Avi Wigderson on the 'P vs. NP' problem

P vs NP: 0:00:59

P vs NP: A Big Puzzle in Computer Science

You'll get 1000000$ 0:00:06

You'll get 1000000$ if you can solve this question | P vs NP problem #computerscience #mathemat...

P vs NP 0:01:28

P vs NP explained quickly | Millennium prize problem

16. Complexity: P, 1:25:25

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

The 'P vs. 0:00:22

The 'P vs. NP Problem'

Does P=NP? | 0:04:38

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

P vs. NP: 0:13:37

P vs. NP: The Unsolvable(?) Computer Science Problem

Комментарии
Автор

views drop off consistently through the series lol...

ldPlayer
Автор

Man, is there no difference between an NP Hard and an NP Complete problem? Cause you start off by calling it an NP Complete problem then you switch at 9:10 to calling it an NP Hard problem.

MrPaulrael
Автор

Why bring up NP-hardness if you are talking about NP-completeness *facepalm*.  This isn't accurate.  You didn't even call the reduction its correct term when you claimed you did.  Your "transformer" is called a polynomial-time reduction or Karp reduction.

DanielPage