Dr. Tomáš Peitl

I studied mathematics at Comenius University in BratislavaExternal link, obtaining a bachelor's degree ("Bc.") in 2013, and a master's degree (magister, "Mgr.") with a focus on algebra in 2015.
I went on to do a PhD in computer science with a focus on quantified Boolean formulas at TU WienExternal link under the supervision of Stefan SzeiderExternal link, which I successfully finished in October 2019.
Since November 2019 I am a postdoc in Olaf Beyersdorff's group in Jena funded by an Erwin Schrödinger Fellowship from the Austrian funding agency FWF.

My research interests are mainly centered around (dependency) (quantified) Boolean formulas (D)QBF, spanning solving, theory, and proof complexity, but also more broadly computational methods in discrete mathematics, graph theory and related areas.
My main focus is on QBF, with an increasing interest in DQBF and (unquantified) propositional satisfiability (SAT).

For a list of my papers see DBLP External linkand my other websiteExternal link.

• "Dependency Learning for QBF", Dagstuhl 2020 (invited)
• "Advanced Dependency Analysis for QBF" (PhD defence), TU Wien, 2019
• "Combining Resolution-path Dependencies with Dependency Learning", SAT 2019 (conference paper)
• "Dependency Learning for QBF", STTI Workshop 2019 (invited)
• "Portfolio-based Algorithm Selection for QBF", CP 2018 (conference paper)
• "QBF Encodings of Chess Problems", QBF Workshop 2018 (contributed)
• "Portfolio-based Algorithm Selection for QBF", QBF Workshop 2018 (contributed)
• "Polynomial-time Validation of QCDCL Certificates", SAT 2018 (conference paper)
• "Long-distance Q-resolution with Dependency Schemes", SAT 2016 (conference paper)
• "Dependencies in QBF, Epiphany Conference", Comenius University in Bratislava 2016 (contributed)