Space Complexity of Random Formulae in Resolution

@article{BenSasson2001SpaceCO,
  title={Space Complexity of Random Formulae in Resolution},
  author={Eli Ben-Sasson and Nicola Galesi},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  year={2001},
  volume={8}
}
We study the space complexity of refuting unsatisfiable random IC-CNFs in the Resolution proof system. We prove thatfor any large enough A, with high probability a random IC-CNF over n variables and An clauses requires resolution clause space of n(n . A-=), for any 0 < E < 112. For constant A, this gives us linear; optimal, lower bounds on the clause space. A nice consequence of this lower bound is the first lower boundfor size of treelike resolution refutations of random 3CNFs with clause… CONTINUE READING
Highly Cited
This paper has 105 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

106 Citations

051015'01'04'08'12'16
Citations per Year
Semantic Scholar estimates that this publication has 106 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…