Please note that this newsitem has been archived, and may contain outdated information or links.
2-3 September 2016, 17th International Workshop on Logic & Computational Complexity (LCC 2016), Marseille, France
LCC meetings are aimed at the foundational interconnections between logic and computational complexity, as present, for example, in: implicit computational complexity (descriptive and type-theoretic methods); deductive formalisms as they relate to complexity (e.g. ramification, weak comprehension, bounded arithmetic, linear logic and resource logics); complexity aspects of finite model theory and databases; complexity-mindful program derivation and verification; computational complexity at higher type; and proof complexity.
The programme will consist of invited lectures as well as contributed talks selected by the Programme Committee. Invited speakers: Anupam Das (Lyon), Hugo Férée (Darmstadt), Yevgeny Kazakov (Ulm) and Emanuel Kieronski (Wroclaw).
For more information, see http://lcc2016.cs.unibo.it/
We welcome submissions of abstracts based on work submitted or published elsewhere, provided that all pertinent information is disclosed at submission time. There will be no formal reviewing as is usually understood in peer-reviewed conferences with published proceedings. The Programme Committee will check relevance and may provide additional feedback. Submission deadline: June 17th, 2016
Please note that this newsitem has been archived, and may contain outdated information or links.