Videos

Start date cannot be after end date.
Lower bounds on the size of semidefinite programming relaxations Thumbnail

Lower bounds on the size of semidefinite programming relaxations

Presenter
  • David Steurer
November 30, 2015
IAS
Polynomial-time tensor decompositions via sum-of-squares Thumbnail

Polynomial-time tensor decompositions via sum-of-squares

Presenter
  • Tengyu Ma
March 21, 2016
IAS
Subsampling Mathematical Relaxations and Average-case Complexity Thumbnail

Subsampling Mathematical Relaxations and Average-case Complexity

Presenter
  • Boaz Barak
May 24, 2010
IAS
Reductions Between Expansion Problems Thumbnail

Reductions Between Expansion Problems

Presenter
  • Madhur Tulsiani
May 18, 2010
IAS
David Bortz - Weak form SciML for Learning Models on Different Scales - IPAM at UCLA Thumbnail

David Bortz - Weak form SciML for Learning Models on Different Scales - IPAM at UCLA

Presenter
  • David Bortz
October 7, 2025
IPAM

For What Should the Bell Toll?

Presenter
  • David Keyes
September 14, 2025
ICERM

Universality for roots of derivatives of entire functions

Presenter
  • David Renfrew
August 7, 2025
ICERM

Creating a datbase of rigorous Maass Forms

Presenter
  • David Lowry-Duda
July 7, 2025
ICERM

Families of $p$-adic fields.

Presenter
  • David Roberts
July 7, 2025
ICERM

Incubating Mathematical Databases

Presenter
  • David Roe
July 7, 2025
ICERM

Modular curves and Serre's open image theorem

Presenter
  • David Zywina
June 27, 2025
ICERM
Dávid Papp - Nonsymmetric conic optimization & dual certificates for sums-of-squares - IPAM at UCLA Thumbnail

Dávid Papp - Nonsymmetric conic optimization & dual certificates for sums-of-squares - IPAM at UCLA

Presenter
  • Dávid Papp
May 19, 2025
IPAM