The complexity of pure literal elimination

DOI10.1007/S10817-005-9008-8MaRDI QIDQ862401zbMATH OpenOpenAlexFDO

Authors Jan Johannsen

Publication date 24 January 2007

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10817-005-9008-8

Mathematics Subject Classification ID

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

Recommendations

• An exponential lower bound for the pure literal rule
• Clause elimination procedures for CNF formulas
• scientific article; zbMATH DE number 1678383
• The probability of pure literals
• The Pure Literal Rule and Polynomial Average Time

Cites work

• scientific article; zbMATH DE number 1263189 (Why is no real title available?)
• scientific article; zbMATH DE number 1950260 (Why is no real title available?)
• A machine program for theorem-proving
• BerkMin: A fast and robust SAT-solver
• New methods for 3-SAT decision and worst-case analysis
• New problems complete for nondeterministic log space
• STACS 2004
• Space-bounded reducibility among combinatorial problems
• Symmetric space-bounded computation
• Theory and Applications of Satisfiability Testing
• Undirected ST-connectivity in log-space

Cited in

(2)

• scientific article; zbMATH DE number 1769207 (Why is no real title available?)
• scientific article; zbMATH DE number 1253963 (Why is no real title available?)

Describes a project that uses

Uses Software

• semprop
• BerkMin
• Chaff

This page was built for publication: The complexity of pure literal elimination

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