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. Tomáš Peitl, Friedrich Slivovsky and Stefan Szeider, Dependency Learning for Quantified Boolean Formulas, in: Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, Australia, August 28-September 1, pages 298-313, 2017. [bibtex] [pdf] [doi]
  2. Tomáš Peitl, Friedrich Slivovsky and Stefan Szeider, Long Distance Q-Resolution with Dependency Schemes, in: Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Labri, Bordeaux, France, July 5-8, pages 500-518, 2016. [bibtex] [pdf] [doi]