Signin

P vs. NP and the Computational Complexity Zoo

hackerdashery • October 8, 2014

Video Thumbnail

You May Also Like

Video Thumbnail

P vs. NP: The Biggest Puzzle in Computer Science

Quanta Magazine

Video Thumbnail

What's a Tensor?

Dan Fleisch

Video Thumbnail

Poincaré Conjecture - Numberphile

Numberphile

Video Thumbnail

This equation will change how you see the world (the logistic map)

Veritasium

Video Thumbnail

But what is the Riemann zeta function? Visualizing analytic continuation

3Blue1Brown

Video Thumbnail

15 Sorting Algorithms in 6 Minutes

Timo Bingmann

Video Thumbnail

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

Up and Atom

Video Thumbnail

8. NP-Hard and NP-Complete Problems

Abdul Bari

Video Thumbnail

P vs. NP - An Introduction

Undefined Behavior

Video Thumbnail

P vs NP on TV - Computerphile

Computerphile

Video Thumbnail

What does it feel like to invent math?

3Blue1Brown

Video Thumbnail

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

MIT OpenCourseWare

Video Thumbnail

What Makes Mario NP-Hard? (Polynomial Reductions)

Undefined Behavior

Video Thumbnail

Turing & The Halting Problem - Computerphile

Computerphile

Video Thumbnail

Donald Knuth: P=NP | AI Podcast Clips

Lex Fridman

Video Thumbnail

Biomedical Scientist Answers Pseudoscience Questions From Twitter | Tech Support | WIRED

WIRED

Video Thumbnail

I visited the world's hardest math class

Gohar Khan

Video Thumbnail

How Cell Service Actually Works

Wendover Productions

Video Thumbnail

The hardest problem on the hardest test

3Blue1Brown

Video Thumbnail

The Riemann Hypothesis, Explained

Quanta Magazine

hackerdashery

About

No channel description available.

Latest Posts

Video Thumbnail

P vs. NP and the Computational Complexity Zoo

hackerdashery