EasyChair Smart SlideUser guide
Author: Olaf Beyersdorff

This page shows all presentations of this author published in EasyChair Smart Slide.

Proof Complexity of Propositional Model Counting

Proof Complexity of Propositional Model Counting

Olaf Beyersdorff, Tim Hoffmann and Luc Nicolas Spachmann

QCDCL vs QBF Resolution: Further Insights

QCDCL vs QBF Resolution: Further Insights

Benjamin Böhm and Olaf Beyersdorff

QCDCL with Cube Learning or Pure Literal Elimination – What Is Best?

QCDCL with Cube Learning or Pure Literal Elimination – What Is Best?

Benjamin Böhm, Tomáš Peitl and Olaf Beyersdorff

Classes of Hard Formulas for QBF Resolution

Classes of Hard Formulas for QBF Resolution

Agnes Schleitzer and Olaf Beyersdorff

Lower Bounds for QCDCL via Formula Gauge

Lower Bounds for QCDCL via Formula Gauge

Benjamin Böhm and Olaf Beyersdorff

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