Understanding space in resolution: optimal lower bounds and exponential trade-offs

@article{BenSasson2008UnderstandingSI,
  title={Understanding space in resolution: optimal lower bounds and exponential trade-offs},
  author={Eli Ben-Sasson and Jakob Nordstr{\"o}m},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  year={2008},
  volume={16},
  pages={34}
}
For current state-of-the-art satisfiability algorithms based on the DPLL procedure and clause learning, the two main bottlenecks are the amounts of time and memory used. Understanding time and memory consumption, and how they are related to one another, is therefore a question of considerable practical importance. In the field of proof complexity, these resources correspond to the length and space of resolution proofs for formulas in conjunctive normal form (CNF). There has been a long line of… CONTINUE READING
Highly Cited
This paper has 22 citations. REVIEW CITATIONS
14 Citations
51 References
Similar Papers

Similar Papers

Loading similar papers…