Propositional Proof Complexity: A Survey on the State of the Art, Including Some Recent Results

Toniann Pitassi. Propositional Proof Complexity: A Survey on the State of the Art, Including Some Recent Results. In Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, LICS 2011, June 21-24, 2011, Toronto, Ontario, Canada. pages 119, IEEE Computer Society, 2011. [doi]

@inproceedings{Pitassi11,
  title = {Propositional Proof Complexity: A Survey on the State of the Art, Including Some Recent Results},
  author = {Toniann Pitassi},
  year = {2011},
  doi = {10.1109/LICS.2011.42},
  url = {http://dx.doi.org/10.1109/LICS.2011.42},
  tags = {survey},
  researchr = {https://researchr.org/publication/Pitassi11},
  cites = {0},
  citedby = {0},
  pages = {119},
  booktitle = {Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, LICS 2011, June 21-24, 2011, Toronto, Ontario, Canada},
  publisher = {IEEE Computer Society},
  isbn = {978-0-7695-4412-0},
}