ABOUT FLOC
HOME About FLoC Sponsors Mailing list Contact
PARTICIPATION
Registration Accommodation Student travel support US-based Student travel support Visa information Cancellation Policy Local information Reimbursement forms (new!)
MEETINGS
CAV CSF ICLP IJCAR ITP LICS RTA SAT Workshops (alpha.) Workshops (by conf.) Affiliated Events
PROGRAM
FLoC at a glance Meeting by meeting Day by day Room assignment Invited talks Accepted papers Social events FLoC Brochure (PDF)
!! LAST MINUTE NEWS !! !! ROOM CHANGES !!
ORGANIZATION
Steering Committee Programme Committee Organising Committee
MISCELLANEOUS
Call for Workshops

Program of PPC

Friday, July 9th

Friday's program is also available with abstracts and side by side with other events.

10:00‑10:30 Coffee break
12:30‑14:00 Lunch
14:00‑15:00 Session 1
Chair: Stefan Dantchev
Location: AT 2.12
14:00 Nicola Galesi (Universita di Roma)
The Complexity of Proofs in Parameterized Resolution
15:00‑15:30 Coffee break
15:30‑16:30 Session 2
Chair: Olga Tveretina
Location: AT 2.12
15:30 Eli Ben-Sasson and Jakob Nordström
Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions
16:00 Stefan Dantchev
Parameterized Proof Complexity
17:00‑18:00 Session 3
Chair: Stefan Dantchev
Location: AT 2.12
17:00 Uwe Bubeck, Hans Kleine Büning, Anja Remshagen and Xishun Zhao
Expressiveness and Complexity of Subclasses of Quantified Boolean Formulas
17:30 Olga Tveretina
Ordered Binary Decision Diagrams Do Not Simulate Resolution Polynomially