Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF

The QSAT problem, which asks to evaluate a quantified Boolean formula (QBF), is of fundamental interest in approximation, counting, decision, and probabilistic complexity and is also considered the prototypical PSPACE-complete problem. As such, it has previously been studied under various structural...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	2023 38TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, LICS S. 1 - 14
Hauptverfasser:	Fichte, Johannes K., Ganian, Robert, Hecher, Markus, Slivovsky, Friedrich, Ordyniak, Sebastian
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 26.06.2023
Schriftenreihe:	IEEE Symposium on Logic in Computer Science
Schlagworte:	Complexity theory Computer science Filling Probabilistic logic Structural engineering Upper bound
ISBN:	9798350335880, 9798350335873
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!