Name
Abstract | ||
|---|---|---|
•Q-Resolution is a central and historically the first Resolution system for QBF.•The KBKF formulas appear prominently throughout the QBF literature.•We give a short, simple, and self-contained proof of their hardness in Q-Resolution. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.ipl.2021.106093 | Information Processing Letters |
Keywords | DocType | Volume |
Computational complexity,Proof complexity,QBF,Q-Resolution,Lower bounds | Journal | 168 |
ISSN | Citations | PageRank |
0020-0190 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Olaf Beyersdorff | 1 | 223 | 30.33 |
| Joshua Blinkhorn | 2 | 3 | 6.16 |