PC 2022 PROGRAM
Days: Sunday, July 31st Monday, August 1st
Sunday, July 31st
View this program: with abstractssession overviewtalk overviewside by side with other conferences
10:30-11:00Coffee Break
12:30-14:00Lunch Break
14:00-15:30 Session 11H
| 14:00 | Towards higher order proof complexity (abstract) PRESENTER: Anupam Das |
| 14:30 | Proof complexity of CSP on algebras with linear congruence (abstract) |
| 15:00 | An observation about (a)symmetries in LK_d proofs (abstract) |
15:30-16:00Coffee Break
16:00-17:30 Session 15D
| 16:00 | TBA |
| 17:00 | On combinatorial principles coming from semi-algebraic proof systems |
Monday, August 1st
View this program: with abstractssession overviewtalk overviewside by side with other conferences
09:00-10:30 Session 19C: Joint QBF Session
| 09:00 | QCDCL with Cube Learning or Pure Literal Elimination – What is best? (abstract) PRESENTER: Benjamin Böhm |
10:30-11:00Coffee Break
12:30-14:00Lunch Break
14:00-15:30 Session 22D
| 14:00 | Average-Case Hardness of Proving Tautologies and Theorems (abstract) |
| 14:30 | Proof complexity of natural formulas via communication arguments (abstract) PRESENTER: Dmitry Itsykson |
| 15:00 | Are Hitting Formulas Hard for Resolution? (abstract) |
15:30-16:00Coffee Break
16:00-17:30 Session 23D
| 16:00 | On vanishing sums of roots of unity in polynomial calculus and sum-of-squares (abstract) PRESENTER: Ilario Bonacina |
| 17:00 | Simulations between proof systems (abstract) |
18:30-20:00Workshop Dinner (at the Technion) - Paid event