1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.CC2020★ 1 cited
Hard QBFs for Merge Resolution
Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan +2
We prove the first genuine QBF proof size lower bounds for the proof system Merge Resolution (MRes [Olaf Beyersdorff et al., 2020]), a refutational proof system for prenex quantifi…
cs.LO2017
Size, Cost, and Capacity: A Semantic Technique for Hard Random QBFs
Olaf Beyersdorff, Joshua Blinkhorn, Luke Hinde
As a natural extension of the SAT problem, an array of proof systems for quantified Boolean formulas (QBF) have been proposed, many of which extend a propositional proof system to…