Olaf Beyersdorff
Olaf Beyersdorff
Professor of Theoretical Computer Science, Friedrich Schiller University Jena, Germany
Verified email at uni-jena.de - Homepage
Title
Cited by
Cited by
Year
Proof complexity of resolution-based QBF calculi
O Beyersdorff, L Chew, M Janota
LIPI Symposium on Theoretical Aspects of Computer Science (STACS'15) 30, 76-89, 2015
732015
On unification of QBF resolution-based calculi
O Beyersdorff, L Chew, M Janota
International Symposium on Mathematical Foundations of Computer Science, 81-93, 2014
552014
Lower bounds: From circuits to QBF proof systems
O Beyersdorff, I Bonacina, C Leroy
Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016
452016
Feasible interpolation for QBF resolution calculi
O Beyersdorff, L Chew, M Mahajan, A Shukla
International Colloquium on Automata, Languages, and Programming, 180-192, 2015
352015
Parameterized complexity of DPLL search procedures
O Beyersdorff, N Galesi, M Lauria
ACM Transactions on Computational Logic (TOCL) 14 (3), 1-21, 2013
352013
The complexity of reasoning for fragments of default logic
O Beyersdorff, A Meier, M Thomas, H Vollmer
International Conference on Theory and Applications of Satisfiability …, 2009
302009
A characterization of tree-like resolution size
O Beyersdorff, N Galesi, M Lauria
Information Processing Letters 113 (18), 666-671, 2013
292013
The complexity of propositional implication
O Beyersdorff, A Meier, M Thomas, H Vollmer
Information Processing Letters 109 (18), 1071-1077, 2009
292009
Are Short Proofs Narrow? QBF Resolution Is Not So Simple
O Beyersdorff, L Chew, M Mahajan, A Shukla
ACM Transactions on Computational Logic (TOCL) 19 (1), 1-26, 2017
282017
A game characterisation of tree-like Q-resolution size
O Beyersdorff, L Chew, K Sreenivasaiah
Journal of Computer and System Sciences 104, 82-101, 2019
262019
Understanding Gentzen and Frege systems for QBF
O Beyersdorff, J Pich
2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-10, 2016
262016
Size, cost, and capacity: A semantic technique for hard random QBFs
O Beyersdorff, J Blinkhorn, L Hinde
arXiv preprint arXiv:1712.03626, 2017
252017
Unified characterisations of resolution hardness measures
O Beyersdorff, O Kullmann
International Conference on Theory and Applications of Satisfiability …, 2014
252014
Unified characterisations of resolution hardness measures
O Beyersdorff, O Kullmann
International Conference on Theory and Applications of Satisfiability …, 2014
252014
A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover–Delayer games
O Beyersdorff, N Galesi, M Lauria
Information Processing Letters 110 (23), 1074-1077, 2010
252010
Classes of representable disjoint NP-pairs
O Beyersdorff
Theoretical Computer Science 377 (1), 93-109, 2007
25*2007
Model checking CTL is almost always inherently sequential
O Beyersdorff, A Meier, M Thomas, H Vollmer, M Mundhenk, T Schneider
2009 16th International Symposium on Temporal Representation and Reasoning …, 2009
222009
Parameterized bounded-depth Frege is not optimal
O Beyersdorff, N Galesi, M Lauria, AA Razborov
ACM Transactions on Computation Theory (TOCT) 4 (3), 7, 2012
212012
Proof systems that take advice
O Beyersdorff, J Köbler, S Müller
Information and Computation 209 (3), 320-332, 2011
21*2011
Reasons for hardness in QBF proof systems
O Beyersdorff, L Hinde, J Pich
ACM Transactions on Computation Theory (TOCT) 12 (2), 1-27, 2020
202020
The system can't perform the operation now. Try again later.
Articles 1–20