A simple proof of QBF hardness

A simple proof of QBF hardness

•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. We provide a simple and direct proof of the exponential hardness o...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 2021-06, Vol.168, p.106093, Article 106093
Hauptverfasser: Beyersdorff, Olaf, Blinkhorn, Joshua
Format: Artikel
Sprache:eng
Schlagworte:
Computational complexity
Lower bounds
Proof complexity
Q-Resolution
QBF
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•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. We provide a simple and direct proof of the exponential hardness of the KBKF formulas in the proof system Q-Resolution.
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2021.106093