Understanding P vs NP: The Key Challenge in Computation Theory 🧠

Explore the fundamentals of P vs NP in this introductory video from Prof. Josh Grochow's Computation Theory course on Complexity Explorer. Perfect for anyone interested in the core problems of computer science!

Understanding P vs NP: The Key Challenge in Computation Theory 🧠
Complexity Explorer
1.7K views • Mar 7, 2019
Understanding P vs NP: The Key Challenge in Computation Theory 🧠

About this video

These videos are from the Introduction to Computation course on Complexity Explorer (complexityexplorer.org) taught by Prof. Josh Grochow. This course is an overview of some basic principles of computation and computational complexity, with an eye towards things that might actually be useful without becoming a researcher.

Students who take this course should have basic knowledge of the principles of graphs. Some tutorial material references linear algebra, but familiarity is not necessary. This tutorial uses proofs, and requires understandings of formal math notations.

Tags and Topics

Browse our collection to discover more content in these categories.

Video Information

Views

1.7K

Likes

32

Duration

10:30

Published

Mar 7, 2019

User Reviews

4.5
(1)
Rate:

Related Trending Topics

LIVE TRENDS

Related trending topics. Click any trend to explore more videos.