No. Title Author Year
1 Genuine Lower Bounds for QBF Expansion Beyersdorff, Olaf et al. 2018
2 Reasons for Hardness in QBF Proof Systems Beyersdorff, Olaf et al. 2018
3 Size, Cost and Capacity: A Semantic Technique for Hard Random QBFs Beyersdorff, Olaf et al. 2018
4 SAT and Interactions (Dagstuhl Seminar 16381) Beyersdorff, Olaf et al. 2017
5 Are Short Proofs Narrow? QBF Resolution is not Simple Beyersdorff, Olaf et al. 2016
6 Understanding Cutting Planes for QBFs Beyersdorff, Olaf et al. 2016
7 Optimal algorithms and proofs (Dagstuhl Seminar 14421) Beyersdorff, Olaf et al. 2015
8 Proof Complexity of Resolution-based QBF Calculi Beyersdorff, Olaf et al. 2015
9 Hardness of Parameterized Resolution Beyersdorff, Olaf et al. 2010
10 Proof Complexity of Propositional Default Logic Beyersdorff, Olaf et al. 2010
Current Page :
Number of result pages: 2
Number of documents: 11


DROPS-Home | Fulltext Search | Imprint Published by LZI