| 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 | 80 | 2015 |
| On unification of QBF resolution-based calculi O Beyersdorff, L Chew, M Janota Mathematical Foundations of Computer Science 2014: 39th International …, 2014 | 61 | 2014 |
| 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 | 47 | 2016 |
| Feasible interpolation for QBF resolution calculi O Beyersdorff, L Chew, M Mahajan, A Shukla Automata, Languages, and Programming: 42nd International Colloquium, ICALP …, 2015 | 40 | 2015 |
| 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 | 33 | 2017 |
| 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 | 32 | 2019 |
| Understanding cutting planes for QBFs O Beyersdorff, L Chew, M Mahajan, A Shukla Information and Computation 262, 141-161, 2018 | 21 | 2018 |
| 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 | 20 | 2019 |
| Lifting QBF resolution calculi to DQBF O Beyersdorff, L Chew, RA Schmidt, M Suda Theory and Applications of Satisfiability Testing–SAT 2016: 19th …, 2016 | 19 | 2016 |
| Extension variables in QBF resolution O Beyersdorf, L Chew, M Janota Workshops at the Thirtieth AAAI Conference on Artificial Intelligence, 2016 | 14 | 2016 |
| Frege systems for quantified Boolean logic O Beyersdorff, I Bonacina, L Chew, J Pich Journal of the ACM (JACM) 67 (2), 1-36, 2020 | 13 | 2020 |
| Short proofs in QBF expansion O Beyersdorff, L Chew, J Clymo, M Mahajan Theory and Applications of Satisfiability Testing–SAT 2019: 22nd …, 2019 | 8 | 2019 |
| QBF proof complexity LN Chew University of Leeds, 2017 | 8 | 2017 |
| Reinterpreting dependency schemes: soundness meets incompleteness in DQBF O Beyersdorff, J Blinkhorn, L Chew, R Schmidt, M Suda Journal of Automated Reasoning 63, 597-623, 2019 | 7 | 2019 |
| Sorting parity encodings by reusing variables L Chew, MJH Heule Theory and Applications of Satisfiability Testing–SAT 2020: 23rd …, 2020 | 6 | 2020 |
| Hardness and optimality in QBF proof systems modulo NP L Chew Theory and Applications of Satisfiability Testing–SAT 2021: 24th …, 2021 | 5 | 2021 |
| How QBF expansion makes strategy extraction hard L Chew, J Clymo Automated Reasoning: 10th International Joint Conference, IJCAR 2020, Paris …, 2020 | 5 | 2020 |
| The equivalences of refutational QRAT L Chew, J Clymo Theory and Applications of Satisfiability Testing–SAT 2019: 22nd …, 2019 | 5 | 2019 |
| Towards uniform certification in QBF L Chew, F Slivovsky arXiv preprint arXiv:2210.07085, 2022 | 4 | 2022 |
| The complexity of theorem proving in circumscription and minimal entailment O Beyersdorff, L Chew Automated Reasoning: 7th International Joint Conference, IJCAR 2014, Held as …, 2014 | 3 | 2014 |
Olaf BeyersdorffProfessor of Theoretical Computer Science, Friedrich Schiller University Jena, GermanyEmail verificata su uni-jena.de
