For more than 40 years, Professor Johan Håstad has been a leading researcher in computational complexity theory. This mini-symposium will celebrate and explore his profound impact on a number of different areas ranging from circuit complexity and cryptography to approximation algorithms and pseudorandomness.
Talks by invited speakers; collaborators, friends, and others influenced by Johan’s work, including:
-
Shafi Goldwasser (MIT)
-
Venkatesan Guruswami (UC Berkeley)
-
Prahladh Harsha (TIFR Mumbai)
-
Ryan O’Donnell (Carnegie Mellon University)
-
Madhu Sudan (Harvard University)
-
Avi Wigderson (Institute for Advanced Study)
Additional speakers to be added.
The event is free of charge and open to the public but registration is required. If you register for this symposium, you are expected to attend both days.
The symposium is organized by the Royal Swedish Academy of Sciences with additional support by The Department of Mathematics at KTH Royal Institute of Technology, Department of Theoretical Computer Science at KTH Royal Institute of Technology and KTH Digital Futures.
Photo: Magnus Bergström
Privacy Policy
When you register for an event at the Royal Swedish Academy of Sciences, the Academy will process your personal data in order to organise the event. Read more in the Academy’s Privacy Policy (se link below)
The Royal Swedish Academy of Sciences occasionally records and photographs during its events. Photographs and video footage will be processed by the Academy and submitted to third parties for processing. Photographs and videos may also be used in our communication activities to provide information about the Academy’s activities in any of the digital and/or printed channels used by the Academy. If you do not consent to this or have other questions about our processing of personal data, please call us on +46 8 673 95 00, or email gdpr@kva.se
Read more about how the Academy processes your personal data
Contact: Peter Brandén
Email: program@kva.se