Using decomposition-parameters for QBF: mind the prefix!

DOI10.1016/j.jcss.2019.12.005zbMath1435.68123MaRDI QIDQ2304627

Sebastian Ordyniak, Robert Ganian, Eduard Eiben

Publication date: 13 March 2020

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://eprints.whiterose.ac.uk/160011/1/main.pdf

zbMATH Keywords

treewidth; pathwidth; parameterized complexity; quantified Boolean formulas; dependency schemes

Mathematics Subject Classification ID

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

68Q27: Parameterized complexity, tractability and kernelization

68R07: Computational aspects of satisfiability