Reasons for Hardness in QBF Proof Systems

Olaf Beyersdorff, Luke Hinde, Ján Pich. Reasons for Hardness in QBF Proof Systems. In Satya V. Lokam, R. Ramanujam, editors, 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017, December 11-15, 2017, Kanpur, India. Volume 93 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.