Should decisions in QCDCL follow prefix order?

DOI10.4230/LIPICS.SAT.2022.11MaRDI QIDQ6572023zbMATH OpenFDO

Authors Benjamin Böhm, Tomáš Peitl, Olaf Beyersdorff

Publication date 12 July 2024

zbMATH Keywords

lower boundsQBFproof complexityCDCL

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Computational aspects of satisfiability (68R07)

This page was built for publication: Should decisions in QCDCL follow prefix order?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6572023)