July 22
@
09:00
–
July 24
@
09:00
This 3-day intensive winter school will cover and discuss two fundamental results in computational complexity, which redefined the way we think about proofs, and led to a plethora of new research directions, results, and insights.
The IP=SPACE Theorem (the power of interaction)
The PCP Theorem (the power of randomization)
Location:University of Sydney, Computer Science Building (J12), Lecture Theatre 123
