Abstract
Olaf Beyersdorff, Joshua Blinkhorn, Tom'a\vs Peitl. Strong (D)QBF Dependency Schemes via Tautology-free Resolution Paths. Proceedings of SAT 2020, The 23rd International Conference on Theory and Applications of Satisfiability Testing (Luca Pulina and Martina Seidl), volume 12178 of Lecture Notes in Computer Science, pages 394-411, 2020, Springer Verlag.
Type
Tomas Peitl
Tomáš Peitl is a Project Assistant at the Algorithms and Complexity Group.