Videos

Start date cannot be after end date.
CSDM - Algebraic geometric codes and their applications Thumbnail

CSDM - Algebraic geometric codes and their applications

Presenter
  • Gil Cohen
September 20, 2016
IAS

Don’t be so discrete! Continuous methods in mathematical art

Presenter
  • Frank Farris
July 1, 2016
ICERM
Reed-Muller codes for random erasures and errors Thumbnail

Reed-Muller codes for random erasures and errors

Presenter
  • Amir Shpilka
April 26, 2016
IAS
A characterization of functions with vanishing averages over products of disjoint sets Thumbnail

A characterization of functions with vanishing averages over products of disjoint sets

Presenter
  • Pooya Hatami
April 19, 2016
IAS

Introduction to the software package 'Dynamics Explorer' for exploration of discrete dynamical systems

Presenter
  • Suzanne Lynch Boyd
April 7, 2016
ICERM
An average-case depth hierarchy theorem for Boolean circuits I Thumbnail

An average-case depth hierarchy theorem for Boolean circuits I

Presenter
  • Li-Yang Tan
April 4, 2016
IAS
A local central limit theorem for triangles in a random graph Thumbnail

A local central limit theorem for triangles in a random graph

Presenter
  • Swastik Kopparty
March 28, 2016
IAS
The Resolution proof system Thumbnail

The Resolution proof system

Presenter
  • Avi Wigderson
March 22, 2016
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
Proof complexity - an introduction Thumbnail

Proof complexity - an introduction

Presenter
  • Avi Wigderson
March 15, 2016
IAS
Lower bounds for homogeneous depth-5 arithmetic circuits over finite fields Thumbnail

Lower bounds for homogeneous depth-5 arithmetic circuits over finite fields

Presenter
  • Mrinal Kumar
March 14, 2016
IAS
Graph isomorphism in quasipolynomial time I Thumbnail

Graph isomorphism in quasipolynomial time I

Presenter
  • László Babai
February 29, 2016
IAS