Agnes Schleitzer

According to our database, Agnes Schleitzer authored at least 2 papers between 2022 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

Computationally Hard Problems Are Hard for QBF Proof Systems Too.

Agnes Schleitzer, Olaf Beyersdorff

Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

2022

Classes of Hard Formulas for QBF Resolution.

Agnes Schleitzer, Olaf Beyersdorff

Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing, 2022