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...

Celý popis

Podrobná bibliografia

Vydané v:	2023 38TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, LICS s. 1 - 14
Hlavní autori:	Fichte, Johannes K., Ganian, Robert, Hecher, Markus, Slivovsky, Friedrich, Ordyniak, Sebastian
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 26.06.2023
Edícia:	IEEE Symposium on Logic in Computer Science
Predmet:	Complexity theory Computer science Filling Probabilistic logic Structural engineering Upper bound
ISBN:	9798350335880, 9798350335873
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!