Benjamin Böhm
where else to find them
no profile links on file
what they talk about
their talks carry no tags yet
where they keep going back
no series more than once — all 2 in the filters
on a stage with
- Olaf Beyersdorffonce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| CDCL vs Resolution: The Picture in QBF | Proof Complexity and Meta-Mathematics 2023 | 2023-03-20 |
The paper proves classical QCDCL and Q-Resolution are incomparable and then pins down which algorithmic changes give exact matches: allowing arbitrary decision… | ||
| Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution | ITCS 2021 | 2021-01-06 |
Paper proves that standard QBF CDCL and Q-resolution are incomparable by giving two explicit families: QParity has polynomial-size QCDCL refutations but… | ||
| nothing matches | ||