The following pages link to Tomáš Peitl (Q1656582):
Displayed 12 items.
- Polynomial-time validation of QCDCL certificates (Q1656583) (← links)
- Dependency learning for QBF (Q1680261) (← links)
- Davis and Putnam meet Henkin: solving DQBF with resolution (Q2118283) (← links)
- Combining resolution-path dependencies with dependency learning (Q2181941) (← links)
- Proof complexity of fragments of long-distance Q-resolution (Q2181942) (← links)
- Long-distance Q-resolution with dependency schemes (Q2417950) (← links)
- Strong (D)QBF dependency schemes via tautology-free resolution paths (Q2661365) (← links)
- Long Distance Q-Resolution with Dependency Schemes (Q2818036) (← links)
- Dependency Learning for QBF (Q4968372) (← links)
- Finding the Hardest Formulas for Resolution (Q5154766) (← links)
- Hardness Characterisations and Size-width Lower Bounds for QBF Resolution (Q5886517) (← links)
- Are hitting formulas hard for resolution? (Q6162037) (← links)