Olaf Beyersdorff
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 2 in the filters
on a stage with
- Benjamin Böhmonce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Connections Between QBF Proof Complexity and Circuit Complexity | Proof Complexity and Meta-Mathematics 2023 | 2023-03-20 |
Proves a tight correspondence: QBF refutations in Frege-like systems exactly mirror circuit lower bounds via strategy extraction that yields programs in… | ||
| 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 | ||