Skip to content

Home

Simons Institute for the Theory of Computing

Search form

  • Annual Fund
    • Funders
    • Simons Foundation
    • Industry Partners
    • Academic Partners
  • Home
  • About
    • Overview
    • Contact
    • Calvin Lab
  • People
    • Overview
    • Scientific Leadership
    • Staff
    • Current Long-Term Visitors
    • Research Fellows
    • Postdoctoral Researchers
    • Scientific Advisory Board
    • Governance Board
    • Industry Advisory Council
    • Affiliated Faculty
    • Science Communicator in Residence
    • Law and Society Fellow
  • Programs & Events
    • Overview
    • Programs
    • Workshops & Symposia
    • Research Pods
    • Internal Program Activities
    • Public Lectures
    • Participate
    • 10th Anniversary Symposium
  • Visiting
    • Overview
    • Directions
    • Berkeley & the Bay Area
    • Accommodation
    • Visas
    • Families
    • Visitor Guide
    • Cal 1 Card
    • IT Guide
    • Bicycle Loans
    • Room Reservations
    • Code of Conduct
  • Watch / Read
    • SimonsTV
    • Program Reports
    • News Stories
    • Calvin Café (blog)
  • Calendar

You are here

  1. ‹ Home
  2. ‹ Programs & Events
  3. ‹ Workshops & Symposia
  4. ‹ Proof Complexity and Meta-Mathematics
Talks
Spring 2023

Lower Bounds Against PC With Extension Variables

Monday, March 20th, 2023, 9:45 am–10:30 am

Add to Calendar

  • iCalendar
  • Outlook
  • Google
Event: 
Proof Complexity and Meta-Mathematics
Speaker: 
Russell Impagliazzo (UCSD)
Location: 

Calvin Lab Auditorium

No abstract available.

  • Overview
  • Programs
  • Workshops & Symposia
    • Upcoming Workshops & Symposia
    • Past Workshops & Symposia
  • Research Pods
  • Internal Program Activities
  • Public Lectures
  • Participate
  • 10th Anniversary Symposium

Privacy Terms of Use Contact Subscribe

© 2013–2020 Simons Institute for the Theory of Computing. All Rights Reserved. ^ top