Algorithms and Hardness for Linear Algebra on Geometric Graphs

Algorithms and Hardness for Linear Algebra on Geometric Graphs

IEEE FOCS: Foundations of Computer Science via YouTube Direct link

Intro

1 of 8

1 of 8

Intro

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Algorithms and Hardness for Linear Algebra on Geometric Graphs

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

  1. 1 Intro
  2. 2 Examples of K and K -graphs
  3. 3 What problem are we solving?
  4. 4 Why solve these problems (part 2)
  5. 5 Notable Results
  6. 6 How? (Sparsifiers)
  7. 7 How? Hardness for Matrix-Vector Multiplication
  8. 8 Why Hamming Nearest Neighbor?

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.