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

DOI10.1016/0020-0190(83)90127-8zbMATH Open0545.68080OpenAlexW297067813MaRDI QIDQ797300FDOQ797300

Authors: 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

Recommendations

• Correction to ``Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
• Corrigendum to: ``Duration problem: basic concept and some extensions
• Corrigenda to ``Dynamic programming on linear pipelines
• Corrigendum to: ``Efficient probabilistic checkable proofs and applications to approximation
• Correction to: ``Complexity of stochastic dual dynamic programming
• Erratum
• scientific article; zbMATH DE number 30299
• Corrigendum to: ``Iterated stack automata and complexity classes

zbMATH Keywords

satisfiabilitypolynomial average timepure literal ruleDavis-Putnam procedures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (3)

• An exponential lower bound for the pure literal rule
• The expected complexity of analytic tableaux analyses in propositional calculus. II
• 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

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