From: Damiano Mazza <Damiano.Mazza-GvcO4e2DtY6Xazpt0qSg7i2dQEUGKa3O@public.gmane.org>
To: dmanet-G033eQCYXkkRtNtAH2Wc8g@public.gmane.org,
categories-59hdLBrVOVU@public.gmane.org,
logic-o02PS0xoJP/q4qjOmvqfQQ@public.gmane.org,
prooftheory-0VDFhBbLC1Y8tAQEoGlWAQ@public.gmane.org,
frogs-nJFXYWEDAR8wZN84zEGlPg@public.gmane.org,
Proof-Complexity-+0VSyhQgw7rtwjQa/ONI9g@public.gmane.org,
finite-model-theory-JyGdfDITRCtaq5fyzuukUWfrygkm6VTR@public.gmane.org,
fom-+I05ep9qJbk3uPMLIKxrzw@public.gmane.org,
types-announce-nHFbR+4dATOoZA3Q9b/B0PZ8FUJU4vz8@public.gmane.org,
gdr-im-JHSeY3WhOOtQFI55V6+gNQ@public.gmane.org,
gdri-ll-1cNGNKGn6cQWZRVrvSGiciX2jo+Vo868geFHuMeyLfo@public.gmane.org,
THEORYNT-0lvw86wZMd8gmrbMBL3H1uW1CriLhL8O@public.gmane.org
Subject: Caleidoscope Complexity School: Call for Participation
Date: Thu, 13 Dec 2018 15:33:11 +0100 [thread overview]
Message-ID: <42babae5-c7e6-e105-7ab4-1df5b88c14a3@lipn.univ-paris13.fr> (raw)
[ The Types Forum (announcements only),
http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]
*** Call for participation***
Caleidoscope: Research School in Computational Complexity
Institut Henri Poincaré, Paris, 17-21 June 2019
http://caleidoscope.sciencesconf.org/
Dear all,
We are delighted to announce the Caleidoscope Research School in
Computational Complexity, to take place at the Institut Henri Poincaré,
Paris 17-21 June 2019. The school is aimed at graduate students and
researchers who already work in some aspects of computational complexity
and/or who would like to learn about the various approaches.
DESCRIPTION
Computational complexity theory was born more than 50 years ago when
researchers started asking themselves what could be computed
efficiently. Classifying problems/functions with respect to the amount
of resources (e.g. time and/or space) needed to solve/compute them
turned out to be an extremely difficult question. This has led
researchers to develop a remarkable variety of approaches, employing
different mathematical methods and theories.
The future development of complexity theory will require a subtle
understanding of the similarities, differences and limitations of the
many current approaches. In fact, even though these study the same
phenomenon, they are developed today within disjoint communities, with
little or no communication between them (algorithms, logic, programming
theory, algebra...). This dispersion is unfortunate since it hinders the
development of hybrid methods and more generally the advancement of
computational complexity as a whole.
The goal (and peculiarity) of the Caleidoscope school is to reunite in a
single event as many different takes on computational complexity as can
reasonably be fit in one week. It is intended for graduate students as
well as established researchers who wish to learn more about
neighbouring areas.
LECTURES
1. Boolean circuits and lower bounds. (Rahul Santhanam, University of
Oxford)
2. Algebraic circuits and geometric complexity. (Peter Bürgisser,
Technical University Berlin)
3. Proof complexity and bounded arithmetic. (Sam Buss, University of
California San Diego)
4. Machine-free complexity (descriptive and implicit complexity). (Anuj
Dawar, University of Cambridge and Ugo Dal Lago, University of Bologna)
In addition to these broad-ranging themes, there will also be three more
focussed topics, providing examples of (already established or
potential) interactions between logic, algebra and complexity:
5. Constraint satisfaction problems. (Libor Barto, Charles University in
Prague)
6. Communication complexity. (Sophie Laplante, Paris 7 University)
7. Duality in formal languages and logic. (Daniela Petrisan, Paris 7
University)
REGISTRATION
Registration to the school is free but mandatory. This is to help us
plan tea/coffee breaks and social activities.
https://caleidoscope.sciencesconf.org/registration/index
FINANCIAL SUPPORT
There may be opportunities for financial support for participants. We
will make relevant information available via the webpage.
https://caleidoscope.sciencesconf.org/
SPONSORS
European Association for Computer Science Logic (http://www.eacsl.org/)
DIM RFSI - Région Île-de-France (https://dim-rfsi.fr/)
Université Paris 13 (https://www.univ-paris13.fr/)
Laboratoire d'Informatique de Paris Nord (https://lipn.univ-paris13.fr/)
next reply other threads:[~2018-12-13 14:33 UTC|newest]
Thread overview: 2+ messages / expand[flat|nested] mbox.gz Atom feed top
2018-12-13 14:33 Damiano Mazza [this message]
-- strict thread matches above, loose matches on Subject: below --
2018-12-13 14:33 Damiano Mazza
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
Avoid top-posting and favor interleaved quoting:
https://en.wikipedia.org/wiki/Posting_style#Interleaved_style
* Reply using the --to, --cc, and --in-reply-to
switches of git-send-email(1):
git send-email \
--in-reply-to=42babae5-c7e6-e105-7ab4-1df5b88c14a3@lipn.univ-paris13.fr \
--to=damiano.mazza-gvco4e2dty6xazpt0qsg7i2dqeugka3o@public.gmane.org \
--cc=Proof-Complexity-+0VSyhQgw7rtwjQa/ONI9g@public.gmane.org \
--cc=THEORYNT-0lvw86wZMd8gmrbMBL3H1uW1CriLhL8O@public.gmane.org \
--cc=categories-59hdLBrVOVU@public.gmane.org \
--cc=dmanet-G033eQCYXkkRtNtAH2Wc8g@public.gmane.org \
--cc=finite-model-theory-JyGdfDITRCtaq5fyzuukUWfrygkm6VTR@public.gmane.org \
--cc=fom-+I05ep9qJbk3uPMLIKxrzw@public.gmane.org \
--cc=frogs-nJFXYWEDAR8wZN84zEGlPg@public.gmane.org \
--cc=gdr-im-JHSeY3WhOOtQFI55V6+gNQ@public.gmane.org \
--cc=gdri-ll-1cNGNKGn6cQWZRVrvSGiciX2jo+Vo868geFHuMeyLfo@public.gmane.org \
--cc=logic-o02PS0xoJP/q4qjOmvqfQQ@public.gmane.org \
--cc=prooftheory-0VDFhBbLC1Y8tAQEoGlWAQ@public.gmane.org \
--cc=types-announce-nHFbR+4dATOoZA3Q9b/B0PZ8FUJU4vz8@public.gmane.org \
/path/to/YOUR_REPLY
https://kernel.org/pub/software/scm/git/docs/git-send-email.html
* If your mail client supports setting the In-Reply-To header
via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line
before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).