Tomáš Peitl

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Small unsatisfiable k-CNFs with bounded literal occurrence	2026-02-03	Paper
Strong (D)QBF dependency schemes via implication-free resolution paths ACM Transactions on Computation Theory	2025-02-25	Paper
Hard QBFs for merge resolution ACM Transactions on Computation Theory	2025-02-25	Paper
QCDCL with cube learning or pure literal elimination -- what is best? Artificial Intelligence	2025-02-12	Paper
A SAT solver's opinion on the Erdős-Faber-Lovász conjecture	2024-11-26	Paper
Should decisions in QCDCL follow prefix order?	2024-07-12	Paper
Should Decisions in QCDCL Follow Prefix Order? Journal of Automated Reasoning	2024-04-29	Paper
Are hitting formulas hard for resolution? Discrete Applied Mathematics	2023-06-15	Paper
Hardness Characterisations and Size-width Lower Bounds for QBF Resolution ACM Transactions on Computational Logic	2023-04-05	Paper
Davis and Putnam meet Henkin: solving DQBF with resolution	2022-03-22	Paper
Finding the hardest formulas for resolution Journal of Artificial Intelligence Research	2021-10-05	Paper
Strong (D)QBF dependency schemes via tautology-free resolution paths	2021-04-07	Paper
Proof complexity of fragments of long-distance Q-resolution	2020-05-20	Paper
Combining resolution-path dependencies with dependency learning	2020-05-20	Paper
Dependency Learning for QBF Journal of Artificial Intelligence Research	2019-07-12	Paper
Long-distance Q-resolution with dependency schemes Journal of Automated Reasoning	2019-05-31	Paper
Polynomial-time validation of QCDCL certificates	2018-08-10	Paper
Dependency learning for QBF	2017-11-15	Paper
Long distance Q-resolution with dependency schemes Theory and Applications of Satisfiability Testing – SAT 2016	2016-09-05	Paper

Research outcomes over time

This page was built for person: Tomáš Peitl