Proof complexity of symbolic QBF reasoning

From MaRDI portal
Revision as of 23:37, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2118330


DOI10.1007/978-3-030-80223-3_28MaRDI QIDQ2118330

Stefan Mengel, Friedrich Slivovsky

Publication date: 22 March 2022

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


68Q25: Analysis of algorithms and problem complexity

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

68R07: Computational aspects of satisfiability



Uses Software