Video From 13w5010: Computational Complexity
Prasad Raghavendra, University of California Berkeley
Tuesday, July 9, 2013 11:26 - 12:28
Approximate constraint satisfaction requires large LP relaxations
- Home
- About
- Resources
- Programs
- General Program Descriptions
- Calendar of All BIRS Events
- List of All Events
- Workshops at CMO (Mexico)
- Workshops at IASM (China)
- Workshops at IMAG (Spain)
- Workshops at UBCO (Canada)
- Workshops at CMI (India)
- List of 5-Day Workshops
- List of 2-Day Workshops
- Focused Research Groups
- Public Lectures
- Research in Teams
- Summer Schools
- Live Stream
- Videos
- Services
- Publications
- Search
- Contact