Paul Beame, Trinh Huynh, Toniann Pitassi. Hardness amplification in proof complexity. In Leonard J. Schulman, editor, Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010. pages 87-96, ACM, 2010. [doi]
@inproceedings{BeameHP10,
title = {Hardness amplification in proof complexity},
author = {Paul Beame and Trinh Huynh and Toniann Pitassi},
year = {2010},
doi = {10.1145/1806689.1806703},
url = {http://doi.acm.org/10.1145/1806689.1806703},
researchr = {https://researchr.org/publication/BeameHP10},
cites = {0},
citedby = {0},
pages = {87-96},
booktitle = {Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
editor = {Leonard J. Schulman},
publisher = {ACM},
isbn = {978-1-4503-0050-6},
}