u/jmiteGrad Student | Theory, Programming Languagesin r/compsci • Recommends
Udacity video possibly (accidentally) claiming NP =/= EXP
0:00 / 0:00
#np-completeness#complexitytheory#theoreticalcomputerscience
Time For Roadblock - Intro to Theoretical Computer Science
Udacity
655K subscribers • 8 videos on Hallway
- Recommended by 1 person: 1 in engineering communities.
Intermediate. Assumes working knowledge.
753 views11 years ago1 recommendation
Computer scienceComputation and complexityAlgorithms
An introduction to complexity theory and the concept of NP-completeness in theoretical computer science.
This video is part of an online course, Intro to Theoretical Computer Science. Check out the course here: udacity.com/course/cs313.Why it's here
1 person recommends thisWhat people say. Linked in a discussion analyzing whether the video mistakenly claims NP is not equal to EXP.