no code implementations • 10 May 2024 • Leif Eriksson, Victor Lagerkvist, George Osipov, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki
The quantified Boolean formula (QBF) problem is an important decision problem generally viewed as the archetype for PSPACE-completeness.
no code implementations • 3 Jul 2021 • Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
Additionally, our approach is not restricted to binary constraints, so it is applicable to a strictly larger class of problems than that of Huang et al.
