Provider: Schloss Dagstuhl - Leibniz Center for Informatics
Database: dblp computer science bibliography
Content:text/plain; charset="utf-8"
TY - CPAPER
ID - DBLP:conf/sat/BlinkhornB19
AU - Blinkhorn, Joshua
AU - Beyersdorff, Olaf
TI - Proof Complexity of QBF Symmetry Recomputation.
BT - Theory and Applications of Satisfiability Testing - SAT 2019 - 22nd International Conference, SAT 2019, Lisbon, Portugal, July 9-12, 2019, Proceedings
SP - 36
EP - 52
PY - 2019//
DO - 10.1007/978-3-030-24258-9_3
UR - https://doi.org/10.1007/978-3-030-24258-9_3
ER -
