Twelve Years of QBF Evaluations: QSAT Is PSPACE-Hard and It Shows

DOI10.3233/FI-2016-1445zbMath1373.68380OpenAlexW2566415304WikidataQ62040536 ScholiaQ62040536MaRDI QIDQ4589245

Enrico Giunchiglia, Armando Tacchella, Paolo Marin, Luca Pulina, Massimo Narizzano

Publication date: 9 November 2017

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2016-1445

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Solution to PSPACE-complete problem using P systems with active membranes with time-freeness ⋮ The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)

This page was built for publication: Twelve Years of QBF Evaluations: QSAT Is PSPACE-Hard and It Shows