EasyChair Smart SlideUser guide
Conference: PC 2018 (Workshop on Proof Complexity 2018)

This page shows all presentations from this conference published in EasyChair Smart Slide.

Complexity of expander-based reasoning and the power of monotone proofs

Complexity of expander-based reasoning and the power of monotone proofs

Samuel Buss, Valentine Kabanets, Antonina Kolokolova and Michal Koucky

On Dual-Rail Based MaxSAT Solving

On Dual-Rail Based MaxSAT Solving

Maria Lluïsa Bonet, Sam Buss, Alexey Ignatiev, Joao Marques-Silva and Antonio Morgado

Bounded induction without parameters

Bounded induction without parameters

Emil Jeřábek

On OBBD Proofs

On OBBD Proofs

Samuel Buss

Branching Program Complexity of Canonical Search Problems and Proof Complexity of Formulas

Branching Program Complexity of Canonical Search Problems and Proof Complexity of Formulas

Alexander Knop

Presentations in this collection: 5
Copyright © 2002 – 2026 EasyChair