QCDCL with Cube Learning or Pure Literal Elimination – What is best?
Authors: Benjamin Böhm, Tomáš Peitl and Olaf Beyersdorff
Paper Information
| Title: | QCDCL with Cube Learning or Pure Literal Elimination – What is best? |
| Authors: | Benjamin Böhm, Tomáš Peitl and Olaf Beyersdorff |
| Proceedings: | PC 2022 Program papers |
| Editors: | Marc Vinyals, Olaf Beyersdorff and Jan Johannsen |
| Keywords: | QBF, CDCL, proof complexity, lower bounds |
| Pages: | 2 |
| Talk: | Aug 01 10:00 (Session 26E: Joint QBF Session) |
| Paper: |  |