Cook explains why P=NP matters.

preview_player
Показать описание
  1. Turing Awardee Clips
Рекомендации по теме
Cook explains why 0:01:04

Cook explains why P=NP matters.

Stephen Cook on 0:01:38

Stephen Cook on P vs NP

NP-Complete Explained (Cook-Levin 0:10:44

NP-Complete Explained (Cook-Levin Theorem)

Proving P=NP Requires 0:02:50

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

Cook on “The 0:05:06

Cook on “The Complexity of Theorem-Proving Procedures“

Cook thinks that 0:01:56

Cook thinks that P does not equal NP.

16. Complexity: P, 1:25:25

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

What P vs 0:17:58

What P vs NP is actually about

If P=NP, you 0:03:36

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

Does P=NP? | 0:04:21

Does P=NP? | Richard Karp and Lex Fridman

P vs NP 0:01:28

P vs NP explained quickly | Millennium prize problem

January 2022 CACM: 0:03:46

January 2022 CACM: Fifty Years of P vs. NP and the Possibility of the Impossible

What is a 0:08:56

What is a polynomial-time reduction? (NP-Hard + NP-complete)

The odds that 0:06:33

The odds that P=NP is 3% | Scott Aaronson and Lex Fridman

What is the 0:07:35

What is the P vs NP Problem?

What will the 0:03:58

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

Cook-Levin Theorem: Full 0:31:30

Cook-Levin Theorem: Full Proof (SAT is NP-complete)

Advanced Data Structures: 0:04:41

Advanced Data Structures: P vs. NP

Can we prove 0:03:19

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

N problem NP 0:02:09

N problem NP problem || NP hard and NP complete problem || design and analysis of algorithms | daa

Hartmanis on nondeterminism 0:04:58

Hartmanis on nondeterminism and its relationship to P=NP.

What It’s Like 0:04:28

What It’s Like Being Married to Neil deGrasse Tyson - Key & Peele

NP-COMPLETENESS - The 0:33:03

NP-COMPLETENESS - The Secret Link Between Thousands of Unsolved Math Problems

P=NP Recap 0:04:45

P=NP Recap

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

SO a latin square problem where you have x number of 1's and y number of 2's each row and column. If it's just 1's and 2's can it be reduced to 2 sat. I'd love to know surely it's quicker to solve than one with more variety of numbers. if you can solve 2 different number latin squares of any size in p time then I know how that could be useful for gaining clues to latin squares using many more numbers.

JikeWimblik
Автор

My answer is I don't want p to be equal to np😂 so the world will remain the same

Bashibash