Quarterly Theory Workshop: Semidefinite Programming Hierarchies and Sum of Squares.
About this series
The Quarterly Theory Workshop brings in three theoretical computer science experts present their perspective and research on a common theme. Chicago area researchers with interest in theoretical computer science are invited to attend. The technical program is in the morning and includes coffee and lunch. The afternoon of the workshop will allow for continued discussion between attendees and the speakers.
- Transit: Noyes St. Purple Line (map).
- Parking: Validation for North Campus Parking Garage (map) available at workshop.
- Registration: none necessary, bring your own name badge from past conference.
This talk will be held in Tech L324 (different from the location on Tuesday).
Tuesday May 17th.
9:30 am – 10:15am: David Steurer: Tensor decompositions, sum-of-squares proofs, and spectral algorithms. (video)
10:20 – 10:30am: Coffee Break
10:30am – 11:15am: Prasad Raghavendra: Lower Bounds on the Size of Semidefinite Programming Relaxations. (video)
11:20am – 11:30am: Coffee Break
11:30 am – 12:15 pm: Boaz Barak: Do algorithms believe in unicorns? (video)
Title: Tensor decompositions, sum-of-squares proofs, and spectral algorithms.