Search 6,000+ CA Community College Courses
A Polynomial Lower Bound on Adaptive Complexity of Submodular Maximization

A Polynomial Lower Bound on Adaptive Complexity of Submodular Maximization

Association for Computing Machinery (ACM) via YouTube Direct link

Onehalf approximation

5 of 7
Previous
Next

5 of 7

Onehalf approximation

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

A Polynomial Lower Bound on Adaptive Complexity of Submodular Maximization

Automatically move to the next video in the Classroom when playback concludes
  1. 1 Introduction
  2. 2 Background material
  3. 3 Adaptive complexity model
  4. 4 Nonmonotone
  5. 5 Onehalf approximation
  6. 6 Hardness
  7. 7 Questions

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.