Publication:3304126

DOI10.4230/LIPIcs.STACS.2018.28zbMath1487.68135arXiv1711.02120MaRDI QIDQ3304126

Sebastian Ordyniak, Robert Ganian, Eduard Eiben

Publication date: 5 August 2020

Full work available at URL: https://arxiv.org/abs/1711.02120

zbMATH Keywords

treewidth; fixed-parameter tractability; QBF; dependency schemes

Mathematics Subject Classification ID

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

03F20: Complexity of proofs

68V15: Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.)

68Q27: Parameterized complexity, tractability and kernelization

68R07: Computational aspects of satisfiability