The complexity of pure literal elimination

DOI10.1007/s10817-005-9008-8zbMath1109.68050OpenAlexW2055823534MaRDI QIDQ862401

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)

Uses Software

• Chaff
• BerkMin
• semprop

Cites Work

• Unnamed Item
• Unnamed Item
• Symmetric space-bounded computation
• Space-bounded reducibility among combinatorial problems
• New methods for 3-SAT decision and worst-case analysis
• BerkMin: A fast and robust SAT-solver
• Undirected ST-connectivity in log-space
• New problems complete for nondeterministic log space
• STACS 2004
• Theory and Applications of Satisfiability Testing
• A machine program for theorem-proving

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