Short Talks by Postdoctoral Members

Probabilistically Checkable Proofs (PCP): What Theoretical Computer Science Discovered About Mathematical Proofs

Date & Time

September 30, 2009 | 2:00pm – 3:00pm

Location

S-101

Speakers

Hadar Dana Moshkovitz

Affiliation

Member, School of Mathematics

Categories