Twelve years of QBF evaluations: QSAT is PSPACE-hard and it shows
DOI10.3233/FI-2016-1445zbMATH Open1373.68380OpenAlexW2566415304WikidataQ62040536 ScholiaQ62040536MaRDI QIDQ4589245FDOQ4589245
Authors: Paolo Marin, Massimo Narizzano, Luca Pulina, Armando Tacchella, Enrico Giunchiglia
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
Recommendations
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)
Cited In (3)
This page was built for publication: Twelve years of QBF evaluations: QSAT is PSPACE-hard and it shows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589245)