The complexity of pure literal elimination
From MaRDI portal
Publication:862401
DOI10.1007/S10817-005-9008-8zbMATH Open1109.68050OpenAlexW2055823534MaRDI QIDQ862401FDOQ862401
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
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- BerkMin: A fast and robust SAT-solver
- A machine program for theorem-proving
- New problems complete for nondeterministic log space
- New methods for 3-SAT decision and worst-case analysis
- Undirected ST-connectivity in log-space
- Symmetric space-bounded computation
- Theory and Applications of Satisfiability Testing
- Space-bounded reducibility among combinatorial problems
- STACS 2004
Cited In (1)
Uses Software
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)
