Complexity results on DPLL and resolution

DOI10.1145/1119439.1119442zbMath1367.68110OpenAlexW3121883445MaRDI QIDQ5277743

Paolo Liberatore

Publication date: 12 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1119439.1119442

zbMATH Keywords

NP-completenesspropositional satisfiabilityDavis-Putnam

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Complexity results on DPLL and resolution