Are Short Proofs Narrow? QBF Resolution is not Simple - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla. Are Short Proofs Narrow? QBF Resolution is not Simple. In Nicolas Ollinger, Heribert Vollmer, editors, 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France. Volume 47 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [doi]

The following publications are possibly variants of this publication:

Are Short Proofs Narrow? QBF Resolution is not SimpleOlaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla. eccc, 22:152, 2015. [doi]

Short Proofs in QBF ExpansionOlaf Beyersdorff, Leroy Chew, Judith Clymo, Meena Mahajan. sat 2019: 19-35 [doi]

Short Proofs in QBF ExpansionOlaf Beyersdorff, Leroy Chew, Judith Clymo, Meena Mahajan. eccc, 25:102, 2018. [doi]

A simple proof of QBF hardnessOlaf Beyersdorff, Joshua Blinkhorn. ipl, 168:106093, 2021. [doi]

runs on WebDSL