P vs NP: Understanding NP-Complete and NP-Hard Problems
An overview of the P vs NP problem in computer science, including explanations of NP-Complete and NP-Hard problems to provide foundational understanding.
Normalized Nerd
11.7K views β’ Nov 30, 2019
About this video
P vs NP is a famous unsolved problem in Computer Science. But before understanding it we should know what is NPC and NPH. I've explained all these things with proper intuition.
#PvsNP #computerscience #complexity
For more videos please subscribe -
http://bit.ly/normalizedNERD
Maximum Likelihood Explained -
https://youtu.be/2PfGO753UHk
Playlist Learn Scikit Learn -
https://www.youtube.com/watch?v=mmnLkKYvGG8&list=PLM8wYQRetTxDHDWU-YBPfKXV3G0TKXvpy
ML Algos from Scratch-
https://www.youtube.com/playlist?list=PLM8wYQRetTxAIU0oOarQeW2WOeYV9LyuG
#PvsNP #computerscience #complexity
For more videos please subscribe -
http://bit.ly/normalizedNERD
Maximum Likelihood Explained -
https://youtu.be/2PfGO753UHk
Playlist Learn Scikit Learn -
https://www.youtube.com/watch?v=mmnLkKYvGG8&list=PLM8wYQRetTxDHDWU-YBPfKXV3G0TKXvpy
ML Algos from Scratch-
https://www.youtube.com/playlist?list=PLM8wYQRetTxAIU0oOarQeW2WOeYV9LyuG
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
11.7K
Likes
143
Duration
26:31
Published
Nov 30, 2019
User Reviews
4.4
(2) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.