A Combinatorial Characterization of Treelike Resolution Space

@article{Esteban2003ACC,
  title={A Combinatorial Characterization of Treelike Resolution Space},
  author={Juan Luis Esteban and Jacobo Tor{\'a}n},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  year={2003}
}
We show that the Player-Adversary game of Pudlák and Impagliazzo [A lower bound for DLL algorithms for k-SAT, in: Proc. 11th Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 128–136] played over CNF propos formulas gives an exact characterization of the space needed in treelike resolution refutations. This characterization combinatorial and independent of the notion of resolution. We use this characterization to give for the first time a se between the space needed in treelike and… CONTINUE READING
Highly Cited
This paper has 43 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 14 references

A

  • M. Alekhnovich, E. Ben-Sasson, A. A. Razborov
  • Wigde son, Space complexity in prepositional…
  • 2002
2 Excerpts

Wigde son , Space complexity in prepositional calculus

  • E. Ben-Sasson, A. A. Razborov, A.
  • SICOM SIAM J . Comput .
  • 2002

Similar Papers

Loading similar papers…