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


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI