| Dependency learning for QBF T Peitl, F Slivovsky, S Szeider Theory and Applications of Satisfiability Testing–SAT 2017: 20th …, 2017 | 38 | 2017 |
| Long-distance Q-resolution with dependency schemes T Peitl, F Slivovsky, S Szeider Journal of Automated Reasoning 63, 127-155, 2019 | 34 | 2019 |
| Dependency learning for QBF T Peitl, F Slivovsky, S Szeider Journal of Artificial Intelligence Research 65, 181-208, 2019 | 32 | 2019 |
| Portfolio-based algorithm selection for circuit qbfs HH Hoos, T Peitl, F Slivovsky, S Szeider Principles and Practice of Constraint Programming: 24th International …, 2018 | 18 | 2018 |
| Hardness characterisations and size-width lower bounds for QBF resolution O Beyersdorff, J Blinkhorn, M Mahajan, T Peitl ACM Transactions on Computational Logic 24 (2), 1-30, 2023 | 16 | 2023 |
| Co-certificate learning with SAT modulo symmetries M Kirchweger, T Peitl, S Szeider arXiv preprint arXiv:2306.10427, 2023 | 9 | 2023 |
| Polynomial-time validation of QCDCL certificates T Peitl, F Slivovsky, S Szeider International Conference on Theory and Applications of Satisfiability …, 2018 | 9 | 2018 |
| Fixed-parameter tractability of dependency QBF with structural parameters R Ganian, T Peitl, F Slivovsky, S Szeider Proceedings of the International Conference on Principles of Knowledge …, 2020 | 7 | 2020 |
| QCDCL with Cube Learning or Pure Literal Elimination–What is best? B Böhm, T Peitl, O Beyersdorff Artificial Intelligence, 104194, 2024 | 6 | 2024 |
| Hard QBFs for merge resolution O Beyersdorff, J Blinkhorn, M Mahajan, T Peitl, G Sood ACM Transactions on Computation Theory 16 (2), 1-24, 2024 | 6 | 2024 |
| Should decisions in QCDCL follow prefix order? B Böhm, T Peitl, O Beyersdorff Journal of Automated Reasoning 68 (1), 5, 2024 | 6 | 2024 |
| Davis and Putnam meet Henkin: Solving DQBF with resolution J Blinkhorn, T Peitl, F Slivovsky Theory and Applications of Satisfiability Testing–SAT 2021: 24th …, 2021 | 6 | 2021 |
| Proof complexity of fragments of long-distance Q-resolution T Peitl, F Slivovsky, S Szeider Theory and Applications of Satisfiability Testing–SAT 2019: 22nd …, 2019 | 6 | 2019 |
| Combining resolution-path dependencies with dependency learning T Peitl, F Slivovsky, S Szeider Theory and Applications of Satisfiability Testing–SAT 2019: 22nd …, 2019 | 5 | 2019 |
| Are hitting formulas hard for resolution? T Peitl, S Szeider Discrete Applied Mathematics 337, 173-184, 2023 | 3 | 2023 |
| A SAT Solver’s Opinion on the Erdős-Faber-Lovász Conjecture M Kirchweger, T Peitl, S Szeider 26th International Conference on Theory and Applications of Satisfiability …, 2023 | 3 | 2023 |
| Finding the hardest formulas for resolution T Peitl, S Szeider Journal of Artificial Intelligence Research 72, 69-97, 2021 | 3 | 2021 |
| Strong (D) QBF dependency schemes via tautology-free resolution paths O Beyersdorff, J Blinkhorn, T Peitl International Conference on Theory and Applications of Satisfiability …, 2020 | 3 | 2020 |
| Qute in the QBF evaluation 2018 T Peitl, F Slivovsky, S Szeider Journal on Satisfiability, Boolean Modeling and Computation 11 (1), 261-272, 2019 | 3 | 2019 |
| Small unsatisfiable -CNFs with bounded literal occurrence T Zhang, T Peitl, S Szeider arXiv preprint arXiv:2405.16149, 2024 | 1 | 2024 |
Stefan SzeiderProfessor, Head of Algorithms and Complexity Group, TU Wien, Vienna, Austria在 szeider.net 的电子邮件经过验证
