Hardness and Optimality in QBF Proof Systems Modulo NP

Abstract

Full Citation:

Leroy Chew. Hardness and Optimality in QBF Proof Systems Modulo NP. 2021, Technical report AC-TR-21-013, Algorithms and Complexity Group, TU Wien.