Understanding P vs NP: Key Concepts in Time Complexity π
Join Prof. Harry Porter from Portland State University in Lecture 61/65 of the Theory of Computation series to explore the fundamental differences between P and NP classes and their significance in computer science.

hhp3
26.8K views β’ Jan 23, 2015

About this video
"Theory of Computation"; Portland State University: Prof. Harry Porter; www.cs.pdx/~harry
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
26.8K
Likes
173
Duration
12:18
Published
Jan 23, 2015
User Reviews
4.2
(5) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
No specific trending topics match this video yet.
Explore All Trends