The Complexity of Resolution Refinements

Josh Buresh-Oppenheim, Toniann Pitassi. The Complexity of Resolution Refinements. In 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 22-25 June 2003, Ottawa, Canada, Proceedings. pages 138, IEEE Computer Society, 2003. [doi]

@inproceedings{Buresh-OppenheimP03,
  title = {The Complexity of Resolution Refinements},
  author = {Josh Buresh-Oppenheim and Toniann Pitassi},
  year = {2003},
  url = {http://csdl.computer.org/comp/proceedings/lics/2003/1884/00/18840138abs.htm},
  tags = {refinement},
  researchr = {https://researchr.org/publication/Buresh-OppenheimP03},
  cites = {0},
  citedby = {0},
  pages = {138},
  booktitle = {18th IEEE Symposium on Logic in Computer Science (LICS 2003), 22-25 June 2003, Ottawa, Canada, Proceedings},
  publisher = {IEEE Computer Society},
  isbn = {0-7695-1884-2},
}