[Proof Complexity] Preannouncement of 4th Swedish Summer School in Computer Science

Jakob Nordström jakobn at kth.se
Wed Dec 21 21:08:15 CET 2016

Dear colleagues,

This is a preannouncement that the Theoretical Computer Science Group
at KTH Royal Institute of Technology will again arrange the Swedish
Summer School in Computer Science (S3CS) during the latter half of
July next year.

The 4th edition of S3CS will focus on the "sibling area" of proof
complexity, namely circuit complexity --- one of the truly classic
areas in theoretical computer science, which has seen an exciting
revival in the last few years. We are very happy to announce that our
speakers are two of the key players behind this revival, namely
Benjamin Rossman (http://www.math.toronto.edu/rossman/) and
Ryan Williams (http://web.stanford.edu/~rrwill/).

S3CS 2017 will again be held at the beautiful venue Djurönäset in the
Stockholm archipelago. A formal call for participation with more
detailed information will follow in early 2017, but for now you can
make note of the following timeline:
- Mid-March: Application deadline
- Mid-April: Notification
- Sun July 16: Arrival
- Mon July 17 -- Fri July 21: Lectures
- Sat July 22: Departure

With best regards,
Jakob Nordström

Jakob Nordström, Associate Professor
School of Computer Science and Communication
KTH Royal Institute of Technology

More information about the Proof-Complexity mailing list