[Theory] Fwd: [Proof Complexity] Summer School on Computational Complexity (Oléron Island, France)
Alexander Razborov
razborov at uchicago.edu
Tue Mar 21 11:00:24 CDT 2023
Begin forwarded message:
> From: Joanna Ochremiak via Proof-Complexity <proof-complexity at math.cas.cz>
> Date: March 21, 2023 at 3:48:27 AM CDT
> To: Proof-Complexity at math.cas.cz
> Subject: [Proof Complexity] Summer School on Computational Complexity (Oléron Island, France)
> Reply-To: Joanna Ochremiak <joanna.ochremiak at gmail.com>
>
> Dear colleagues,
>
> Please find below a school announcement, with an excellent programme and
> internationally-renowned speakers. The school is open to students,
> post-docs and established researchers. I would be very grateful for any
> assistance in spreading the information about the school.
>
> Apologies for cross-posting.
>
> Best regards,
> Joanna Ochremiak
>
> ==================================================================
>
> EPIT 2023: The Kaleidoscope of Complexity Theory
> 50th École de Printemps d'Informatique Théorique
>
> 12-16 June, Île d'Oléron, France
> https://epit2023.sciencesconf.org
>
> ==================================================================
>
> We are happy to announce that the 50th edition of EPIT (École de Printemps
> d'Informatique Théorique, https://epit.irif.fr) The Kaleidoscope of
> Complexity Theory
> will take place at the Vieille Perrotine CAES/CNRS holiday center on Oléron
> Island
> (on the Atlantic coast of France), from Monday June 12 to Friday June 16,
> 2023.
>
> EPIT is intended for PhD students as well as established researchers
> who wish to learn more about neighboring areas.
>
> Registration is open!
>
> PROGRAM
>
> The school will consist of 6 courses, on the following topics:
>
> 1. Descriptive Complexity
> Albert Atserias, Universitat Politècnica de Catalunya
> 2. Randomness
> Valentine Kabanets, Simon Fraser University
> 3. Lower Bounds
> Paul Beame, University of Washington
> 4. Hardness of Approximation
> Irit Dinur, Weizmann Institute
> 5. Fine-Grained and Parameterized Complexity
> Michał Pilipczuk, University of Warsaw
> 6. Algebraic and Geometric Complexity
> Guillaume Malod, Université Paris Cité, and
> Christian Ikenmeyer, University of Liverpool
>
> More information is available from our website:
> https://epit2023.sciencesconf.org
>
> ORGANIZATION
>
> Damiano Mazza, CNRS, Université Sorbonne Paris Nord
> Joanna Ochremiak, CNRS, Université de Bordeaux & University of Warsaw
> Sylvain Perifel, Université Paris Cité
> Thomas Seiller, CNRS, Université Sorbonne Paris Nord
>
> If you have any questions, please contact us at:
> epit2023 at sciencesconf.org
> _______________________________________________
> Proof-Complexity mailing list
> Proof-Complexity at math.cas.cz
> https://list.math.cas.cz/listinfo/proof-complexity
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mailman.cs.uchicago.edu/pipermail/theory/attachments/20230321/2324b55c/attachment.html>
More information about the Theory
mailing list