Hypergraph K-Cut for Fixed K in Deterministic Polynomial Time

Hypergraph K-Cut for Fixed K in Deterministic Polynomial Time

IEEE FOCS: Foundations of Computer Science via YouTube Direct link

The structural theorem

6 of 9

6 of 9

The structural theorem

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Hypergraph K-Cut for Fixed K in Deterministic Polynomial Time

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Introduction
  2. 2 Hypergraph kcut
  3. 3 Motivations
  4. 4 Partial progress
  5. 5 The technique
  6. 6 The structural theorem
  7. 7 Our technique
  8. 8 Structural result
  9. 9 Open questions

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.