Completed
Summary
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Hardness of Coding Problems
Automatically move to the next video in the Classroom when playback concludes
- 1 SETH-Hardness of Coding Problems
- 2 Linear Codes
- 3 Nearest Codeword Problem (NCP)
- 4 The Strong Exponential Time Hypothesis (SETH)
- 5 Reduction to NCP
- 6 2-SAT without Negations...
- 7 Finishing the Reduction (without negations...)
- 8 Negated Variables
- 9 Additional NCP Results
- 10 Minimum Distance Problem (MDP)
- 11 Summary
