Takip et
Olaf Beyersdorff
Olaf Beyersdorff
Professor of Theoretical Computer Science, Friedrich Schiller University Jena, Germany
uni-jena.de üzerinde doğrulanmış e-posta adresine sahip - Ana Sayfa
Başlık
Alıntı yapanlar
Alıntı yapanlar
Yıl
Proof complexity of resolution-based QBF calculi
O Beyersdorff, L Chew, M Janota
32nd International Symposium on Theoretical Aspects of Computer Science …, 2015
842015
On unification of QBF resolution-based calculi
O Beyersdorff, L Chew, M Janota
Mathematical Foundations of Computer Science 2014: 39th International …, 2014
692014
Quantified boolean formulas
O Beyersdorff, M Janota, F Lonsing, M Seidl
Handbook of Satisfiability, 1177-1221, 2021
542021
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
502016
Size, cost, and capacity: A semantic technique for hard random QBFs
O Beyersdorff, J Blinkhorn, L Hinde
Logical Methods in Computer Science 15, 2019
462019
Feasible interpolation for QBF resolution calculi
O Beyersdorff, L Chew, M Mahajan, A Shukla
Logical Methods in Computer Science 13, 2017
442017
Parameterized complexity of DPLL search procedures
O Beyersdorff, N Galesi, M Lauria
ACM Transactions on Computational Logic (TOCL) 14 (3), 1-21, 2013
442013
A characterization of tree-like resolution size
O Beyersdorff, N Galesi, M Lauria
Information Processing Letters 113 (18), 666-671, 2013
372013
New resolution-based QBF calculi and their proof complexity
O Beyersdorff, L Chew, M Janota
ACM Transactions on Computation Theory (TOCT) 11 (4), 1-42, 2019
362019
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
362010
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
352017
Classes of representable disjoint NP-pairs
O Beyersdorff
Theoretical Computer Science 377 (1), 93-109, 2007
34*2007
Reasons for hardness in QBF proof systems
O Beyersdorff, L Hinde, J Pich
ACM Transactions on Computation Theory (TOCT) 12 (2), 1-27, 2020
332020
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
332019
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
332009
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
322012
The complexity of propositional implication
O Beyersdorff, A Meier, M Thomas, H Vollmer
Information Processing Letters 109 (18), 1071-1077, 2009
322009
Understanding Gentzen and Frege systems for QBF
O Beyersdorff, J Pich
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016
292016
Lifting QBF resolution calculi to DQBF
O Beyersdorff, L Chew, RA Schmidt, M Suda
International Conference on Theory and Applications of Satisfiability …, 2016
262016
On the correspondence between arithmetic theories and propositional proof systems–a survey
O Beyersdorff
Mathematical Logic Quarterly 55 (2), 116-137, 2009
26*2009
Sistem, işlemi şu anda gerçekleştiremiyor. Daha sonra yeniden deneyin.
Makaleler 1–20