Optimization, Complexity and Math - Can We Prove P!=NP by Gradient Descent?

Optimization, Complexity and Math - Can We Prove P!=NP by Gradient Descent?

Society for Industrial and Applied Mathematics via YouTube Direct link

PMs & symbolic matrices [Edmonds'67]

3 of 11

3 of 11

PMs & symbolic matrices [Edmonds'67]

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Optimization, Complexity and Math - Can We Prove P!=NP by Gradient Descent?

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

  1. 1 Intro
  2. 2 Perfect Matchings (PMs)
  3. 3 PMs & symbolic matrices [Edmonds'67]
  4. 4 Symbolic matrices dual life
  5. 5 Matrix Scaling
  6. 6 Analysis of the algorithm
  7. 7 Operator Scaling Gurvits '04 a quantum leap
  8. 8 Operator scaling algorithm
  9. 9 6 areas, 6 problems GGOW15-16
  10. 10 Invariant theory
  11. 11 Conclusions & Open Problems

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.