Hardness of Coding Problems

Hardness of Coding Problems

IEEE FOCS: Foundations of Computer Science via YouTube Direct link

2-SAT without Negations...

6 of 11

6 of 11

2-SAT without Negations...

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. 1 SETH-Hardness of Coding Problems
  2. 2 Linear Codes
  3. 3 Nearest Codeword Problem (NCP)
  4. 4 The Strong Exponential Time Hypothesis (SETH)
  5. 5 Reduction to NCP
  6. 6 2-SAT without Negations...
  7. 7 Finishing the Reduction (without negations...)
  8. 8 Negated Variables
  9. 9 Additional NCP Results
  10. 10 Minimum Distance Problem (MDP)
  11. 11 Summary

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.