Understanding P vs NP: Formal Definition & Complexity

Explore the formal definition of P, decision problems, and the P vs NP question in computational complexity. πŸ”

Understanding P vs NP: Formal Definition & Complexity
Undefined Behavior
30.8K views β€’ Nov 4, 2017
Understanding P vs NP: Formal Definition & Complexity

About this video

Let’s take a deeper look at the complexity class P, and decision problems.

Created by: Cory Chang
Produced by: Vivian Liu
Script Editor: Justin Chen, Elaine Chang, Zachary Greenberg, Alex Egan

Twitter: https://twitter.com/UBehavior

β€”

P vs NP Playlist: https://www.youtube.com/playlist?list=PLlwsleWT767dnN25K_QgvdKkovK_t4K6-
Decision vs Search: https://cseweb.ucsd.edu/~mihir/cse200/decision-search.pdf
The Complexity of Decision versus Search: https://cseweb.ucsd.edu/~mihir/papers/compip.pdf
P (Wiki): https://en.wikipedia.org/wiki/P_(complexity)
Decision Problem (Wiki): https://en.wikipedia.org/wiki/Decision_problem
Reduction (Wiki): https://en.wikipedia.org/wiki/Reduction_(complexity)
Function Problem (Wiki): https://en.wikipedia.org/wiki/Function_problem
Triangle Number (Wiki): https://en.wikipedia.org/wiki/Triangular_number

Tags and Topics

Browse our collection to discover more content in these categories.

Video Information

Views

30.8K

Likes

746

Duration

6:15

Published

Nov 4, 2017

User Reviews

4.6
(6)
Rate:

Related Trending Topics

LIVE TRENDS

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