An exponential lower bound for the pure literal rule

DOI10.1016/0020-0190(88)90028-2zbMath0646.68061OpenAlexW2076029782MaRDI QIDQ1104093

Paul Walton jun. Purdom, Khaled M. Bugrara

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90028-2

zbMATH Keywords

average time analysisDavis-Putnam procedurepure literal rule

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Corrigendum to ``Average time analyses of simplified Davis-Putnam procedures
• Polynomial-average-time satisfiability problems
• The Pure Literal Rule and Polynomial Average Time
• A machine program for theorem-proving
• Unnamed Item

This page was built for publication: An exponential lower bound for the pure literal rule