April 21, 2014

Workshop: Barriers in Computational Complexity

“Barriers in Computational Complexity” workshop

August 25-29, 2009.

Organizers: Russell Impagliazzo and Avi Wigderson

Email: barriers.workshop

The focus of the workshop will be on identifying and circumventing the barriers that are preventing progress in a number of related areas of complexity: lower bounds for Boolean complexity, lower bounds for algebraic circuits, proof complexity, learning theory
and derandomization. We hope that this workshop will set an agenda for progress in these fields.

Registration: To request to register to the workshop send an email to barriers.workshop

Click here for tentative program

Local information: If you plan to come to the workshop and need a hotel room, we suggest you register and reserve a room at the Nassau Inn as soon as possible. Their phone number is 1-800-862-7728 or 609-921-7500, and you should ask for group #12978 or “barriers workshop” block. The contracted rate is $132 per night. Click here for campus map, including CS department, parking lots, and Palmer House.

Driving and Parking information. Visitors coming to campus on weekdays from 8 am to 5 pm may park in Lot 21 near Jadwin Gymnasium. They can also garage #3 (highest level) on Prospect Street. Place this parking pass on your dashboard. See also this parking map and the campus map above. Directions to campus link here: http://www.princeton.edu/main/visiting/travel/driving/

Use this link to make reservations to an airport shuttle with Princeton University discount.

We have some limited funds to cover participants cost, if you need such support please contact the organizers. You’ll also need to use the following forms: pu-expense-reports1 travel-expense-report

Student Support:
We will cover accommodations at the Nassau Inn (based on 2 per room) for eligible graduate students. Applications by students (including CV, short statement of interest, and a short recommendation letter from the graduate advisor) should be e-mailed to barriers.workshop together with dates of attendance. This support will be given on a first-come first-serve basis based on availability of funds.