Program of PPC

Friday, July 9th

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

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: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