Skip to main content

Utility navigation

  • Calendar
  • Contact
  • Login
  • Make a Gift
Berkeley University of California
Home Home

Main navigation

  • Home
  • Programs & Events
    • Research Programs
    • Research Pods
    • Workshops & Symposia
    • Public Lectures
    • Internal Program Activities
  • People
    • Scientific Leadership
    • Staff
    • Current Long-Term Visitors
    • Research Fellows
    • Postdoctoral Researchers
    • Scientific Advisory Board
    • Governance Board
    • Industry Advisory Council
    • Affiliated Faculty
    • Science Communicators in Residence
    • Law and Society Fellows
  • Participate
    • Ways to Participate
    • Postdoctoral Research Fellowships
    • Law and Society Fellowships
    • Science Communicator in Residence Program
    • Plan Your Visit
  • Support
    • Annual Fund
    • Funders
    • Industrial Partnerships
    • Academic Partnerships
  • News & Videos
    • News
    • Videos
  • About

Lower Bounds in Computational Complexity

Wednesday, Aug. 15 – Friday, Dec. 14, 2018

Breadcrumb

  1. Home
  2. Programs & Events
  3. Lower Bounds in Computational Complexity

Secondary tabs

  • The Program
  • Workshops(active tab)
  • Internal Activities
Lower Bounds in Computational Complexity Boot Camp
Aug. 20 – 24, 2018
Lower Bounds in Computational Complexity Boot Camp
Amir Yehudayoff (Technion Israel Institute of Technology; chair)
Anup Rao (University of Washington)
Ryan Williams (MIT)
Details of Lower Bounds in Computational Complexity Boot Camp
Boolean Devices
Sept. 10 – 14, 2018
Boolean Devices
Benjamin Rossman (University of Toronto; chair)
Rahul Santhanam (University of Oxford)
Avi Wigderson (Institute for Advanced Study, Princeton)
Details of Boolean Devices
Interactive Complexity
Oct. 15 – 18, 2018
Interactive Complexity
Kasper Green Larsen (Aarhus University; chair)
Mark Braverman (Princeton University)
Michael Saks (Rutgers University)
Details of Interactive Complexity
Algebraic Methods
Dec. 3 – 7, 2018
Algebraic Methods
Shubhangi Saraf (University of Toronto; chair)
Amir Shpilka (Tel Aviv University)
Madhu Sudan (Harvard University)
Details of Algebraic Methods
Lower Bounds in Computational Complexity Reunion
Dec. 9 – 12, 2019
Lower Bounds in Computational Complexity Reunion
Amir Yehudayoff (Technion Israel Institute of Technology; chair)
Anup Rao (University of Washington)
Ryan Williams (MIT)
Details of Lower Bounds in Computational Complexity Reunion
Share this page
Copy URL of this page
Home
The Simons Institute for the Theory of Computing is the world's leading venue for collaborative research in theoretical computer science.

Footer

  • Programs & Events
  • About
  • Participate
  • Workshops & Symposia
  • Contact Us
  • Calendar

Footer social media

  • Twitter
  • Facebook
  • Youtube
© 2013–2023 Simons Institute for the Theory of Computing. All Rights Reserved.
link to homepage

Main navigation

  • Home
  • Programs & Events
    • Research Programs
    • Research Pods
    • Workshops & Symposia
    • Public Lectures
    • Internal Program Activities
  • People
    • Scientific Leadership
    • Staff
    • Current Long-Term Visitors
    • Research Fellows
    • Postdoctoral Researchers
    • Scientific Advisory Board
    • Governance Board
    • Industry Advisory Council
    • Affiliated Faculty
    • Science Communicators in Residence
    • Law and Society Fellows
  • Participate
    • Ways to Participate
    • Postdoctoral Research Fellowships
    • Law and Society Fellowships
    • Science Communicator in Residence Program
    • Plan Your Visit
  • Support
    • Annual Fund
    • Funders
    • Industrial Partnerships
    • Academic Partnerships
  • News & Videos
    • News
    • Videos
  • About

Utility navigation

  • Calendar
  • Contact
  • Login
  • Make a Gift
link to homepage