Computing with SAT oracles: past, present and future
From MaRDI portal
Publication:1670750
DOI10.1007/978-3-319-94418-0_27OpenAlexW2811313511MaRDI QIDQ1670750
Publication date: 6 September 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-94418-0_27
Analysis of algorithms and problem complexity (68Q25) 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) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Related Items (2)
DEL-based epistemic planning: decidability and complexity ⋮ On almost-uniform generation of SAT solutions: the power of 3-wise independent hashing
This page was built for publication: Computing with SAT oracles: past, present and future
