Hardness amplification in proof complexity

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.