Tomáš Peitl

  • Project Assistant, MSc
  • TU Wien
  • Algorithms and Complexity Group
  • Institute of Computer Graphics and Algorithms 186/1
  • Favoritenstraße 9–11
  • 1040 Wien
  • Austria


Research Interests

  • Quantified Boolean Formulas, SAT, Complexity Theory

Current Position


Education


Publications

  1. Long Distance Q-Resolution with Dependency Schemes Tomáš Peitl, Friedrich Slivovsky and Stefan Szeider Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Labri, Bordeaux, France, July 5-8, pages 500-518, 2016. [bibtex] [pdf] [doi]
  2. Dependency Learning for Quantified Boolean Formulas Tomáš Peitl, Friedrich Slivovsky and Stefan Szeider Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, Australia, August 28-September 1, pages 298-313, 2017. [bibtex] [pdf] [doi]
  3. Portfolio-Based Algorithm Selection for Circuit QBFs Holger H. Hoos, Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider Proceedings of CP 2018, the 24rd International Conference on Principles and Practice of Constraint Programming (John N. Hooker, ed.), volume 11008 of Lecture Notes in Computer Science, pages 195–209, 2018. [bibtex] [pdf]
  4. Polynomial-Time Validation of QCDCL Certificates Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider Proceedings of SAT 2018, the 21st International Conference on Theory and Applications of Satisfiability Testing, Part of FLoC 2018, July 9–12, 2018, Oxford, UK (Olaf Beyersdorff, Christoph M. Wintersteiger, eds.), volume 10929 of Lecture Notes in Computer Science, pages 253–269, 2018. [bibtex] [pdf] [doi]
  5. Long-Distance Q-Resolution with Dependency Schemes Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider Journal of Automated Reasoning, pages 1–29, 2018. [bibtex] [pdf] [doi]