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


DROPS-Home | Fulltext Search | Imprint Published by LZI