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
The recent announcement of NSF funding opportunities for "Increasing College Opportunity Through Improved Mathematics Success in the First Two Years of College", and other information about NSF Thumbnail

The recent announcement of NSF funding opportunities for "Increasing College Opportunity Through Improved Mathematics Success in the First Two Years of College", and other information about NSF

Presenter
  • Lee Zia
March 20, 2015
SLMath
Problems related to the Stein-Tomas theorem Thumbnail

Problems related to the Stein-Tomas theorem

Presenter
  • Andreas Seeger
May 7, 2014
IPAM
The Lang-Weil inequality and the etale fundamental group Thumbnail

The Lang-Weil inequality and the etale fundamental group

Presenter
  • Terence Tao
April 11, 2014
IPAM
Derandomization of Probabilistic Logspace (The Nisan Variations) Thumbnail

Derandomization of Probabilistic Logspace (The Nisan Variations)

Presenter
  • Avi Wigderson
March 5, 2013
IAS
Polynomial Identity Testing of Read-Once Oblivious Algebraic Branching Progress Thumbnail

Polynomial Identity Testing of Read-Once Oblivious Algebraic Branching Progress

Presenter
  • Michael Forbes
November 26, 2012
IAS
CSDM: A Tutorial on the Likely Worst-Case Complexities of NP-Complete Problems Thumbnail

CSDM: A Tutorial on the Likely Worst-Case Complexities of NP-Complete Problems

Presenter
  • Russell Impagliazzo
January 24, 2012
IAS
Local Testing and Decoding of Sparse Linear Codes Thumbnail

Local Testing and Decoding of Sparse Linear Codes

Presenter
  • Shubhangi Saraf
February 22, 2011
IAS
Fast Random Projections Thumbnail

Fast Random Projections

Presenter
  • Edo Liberty
February 7, 2011
IAS
Hardness Escalation and the Rank of Polynomial Threshold Proofs Thumbnail

Hardness Escalation and the Rank of Polynomial Threshold Proofs

Presenter
  • Paul Beame
November 30, 2010
IAS
Can Complexity Theory Ratify the Invisible Hand of the Market? Thumbnail

Can Complexity Theory Ratify the Invisible Hand of the Market?

Presenter
  • Vijay Vazirani
April 19, 2010
IAS
Algorithmic Dense Model Theorems, Decompositions, and Regularity Theorems Thumbnail

Algorithmic Dense Model Theorems, Decompositions, and Regularity Theorems

Presenter
  • Russell Impagliazzo
December 8, 2009
IAS