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


DROPS-Home | Fulltext Search | Imprint Published by LZI