Corrigendum to ``Average time analyses of simplified Davis-Putnam procedures

DOI10.1016/0020-0190(83)90127-8zbMath0545.68080OpenAlexW297067813MaRDI QIDQ797300

N. E. Zubov

Publication date: 1983

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(83)90127-8

zbMATH Keywords

satisfiabilitypolynomial average timepure literal ruleDavis-Putnam procedures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (3)

The expected complexity of analytic tableaux analyses in propositional calculus. II ⋮ An exponential lower bound for the pure literal rule ⋮ The large deviations of the whitening process in random constraint satisfaction problems

This page was built for publication: Corrigendum to ``Average time analyses of simplified Davis-Putnam procedures