Hardness Amplification in Proof Complexity

Published: Jan. 4, 2010, 7:19 p.m.

Paul Beame delivers a lecture as part of the University of Chicago Theory Seminars hosted by the Computer Science Department.