Theory Seminar - Algorithms and Hardness for Linear Algebra on Geometric Graphs, Aaron Schild
Paul G. Allen School via YouTube
Overview
Syllabus
Intro
The n-body problem (gravitation)
body as adjacency matrix-vector multiplication
Fast multipole method (FMM) (GR87)
Remainder of the Talk
Outline of FMM (GR87)
Background: Well-separated pairs decomposition (WSPD)
Callahan-Kosaraju construction of 2-WSPD on X
h= f and A, B are arbitrary
Can FMM be improved?
Background strong exponential time hypothesis (SETH)
Background: approximate nearest neighbors
Hardness part 1
Hardness Summary
Open problem 1: when does FMM apply?
Other problems we studied
Open problem 2: graph problems we didn't study
Conclusion
Taught by
Paul G. Allen School