YoVDO

Fast Spectral Algorithms from Sum-of-Squares Analyses

Offered By: Simons Institute via YouTube

Tags

Advanced Algorithms Courses

Course Description

Overview

Explore a 39-minute lecture by Tselil Schramm from UC Berkeley on fast spectral algorithms derived from sum-of-squares analyses. Delve into the intersection of hierarchies, extended formulations, and matrix-analytic techniques as part of the Simons Institute's series on advanced algorithmic concepts. Gain insights into cutting-edge research that bridges theoretical computer science and practical algorithm design.

Syllabus

Fast Spectral Algorithms from Sum-of-Squares Analyses


Taught by

Simons Institute

Related Courses

Advanced Algorithms and Complexity
University of California, San Diego via Coursera
NP-Complete Problems
University of California, San Diego via edX
Efficient Zero Knowledge Proof from Interactive Proofs
Simons Institute via YouTube
Dynamic Algorithms for LIS and Distance to Monotonicity
Association for Computing Machinery (ACM) via YouTube
Near-Optimal Decremental SSSP in Dense Weighted Digraphs
IEEE via YouTube