Post

Teaser: a colleague (Sasha Rubin) and I are planning a 3-day (free) "intensive Winter school" at #USyd on computational complexity: specifically, interactive proofs (IP=PSPACE) and the PCP theorem. July 22-24! I don't know how many people here are nearby and keen, but if you are: please do join!

Clément Canonne

@ccanonne.github.io

31 May

Intended audience: anyone interested with at least an undergrad level in computational complexity (models of computation, NP-completeness) and discrete maths background. UG, PG, PhD... All welcome. More details coming soon!

Nigel James

@nigeljam.es

Hmmmm. Sounds fun. There will be a lot of big words I don't understand but I am trying to expand my mathematical muscles that haven't had much work since dykstra's algorithm in second year uni nearly 30 years ago.

31/5/26, 9:42 am0 reposts0 likes

Clément Canonne

@ccanonne.github.io

31 May

As a way to get these "mathematical muscles" back in shape, Avi Wigderson's book is a great resource! He discusses a lot there (IP, etc. are in Chapter 10: see the draft available there): www.math.ias.edu/avi/book

math.ias.eduBook: Math and Computation | Avi Wigderson

Nigel James

@nigeljam.es

31 May

Thanks for the link. I have been working through "All the math(s) you missed" www.booktopia.com.au/all-the-math...

booktopia.com.auAll the Math You MissedBuy All the Math You Missed, (But Need to Know for Graduate School) by Thomas A. Garrity from Booktopia. Get a discounted Paperback from Australia's leading online bookstore.