Pseudopolynomial-Time Algorithms for Optimization Problems

Pseudopolynomial-Time Algorithms for Optimization Problems

Hausdorff Center for Mathematics via YouTube Direct link

Average free sets

3 of 13
Previous
Next

3 of 13

Average free sets

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Pseudopolynomial-Time Algorithms for Optimization Problems

Automatically move to the next video in the Classroom when playback concludes
  1. 1 Intro
  2. 2 Conditional lower bounds
  3. 3 Average free sets
  4. 4 Reduction
  5. 5 Polyend factors
  6. 6 Subset sum
  7. 7 Color coding
  8. 8 Large and small items
  9. 9 Generalizations
  10. 10 Other Parameters
  11. 11 Curious Parameters
  12. 12 Knapsack
  13. 13 Approximation Schemes

Never Stop Learning.

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

Sign up for free
Someone learning on their laptop while sitting on the floor.