FLOC 2018: FEDERATED LOGIC CONFERENCE 2018
SLIDES

On OBBD Proofs

Samuel Buss

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

Samuel Buss, Valentine Kabanets, Antonina Kolokolova and Michal Koucky

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

Alexander Knop

On Dual-Rail Based MaxSAT Solving

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

Bounded induction without parameters

Emil Jeřábek
Total: 5 presentations.