Universiteit van Amsterdam

Events

Institute for Logic, Language and Computation

Please note that this newsitem has been archived, and may contain outdated information or links.

26-30 March 2012, Newton Institute Workshop "Logical Approaches to Barriers in Complexity II", Cambridge, U.K.

Date: 26-30 March 2012
Location: Cambridge, U.K.

Computational complexity theory has its origin in logic. The fundamental goal of this area is to understand the limits of efficient computation and the sources of intractability. The most famous open problem in the area is the P = NP-problem, listed among the seven Clay Millenium Prize problems. Logic provides a multifarious toolbox of techniques to analyse questions like this, some of which promise to provide deep insights in the nature and limits of efficient computation. In our workshop, we shall focus on logical descriptions of complexity, i.e. descriptive complexity, propositional proof complexity and bounded arithmetic.

The workshop will bring together leading researchers covering all research areas within the scope of the workshop. We will especially focus on work that draws on methods from the different areas which appeal to the whole community.

Deadline for application for participation: 26th January 2012 For more information, see http://www.newton.ac.uk/programmes/SAS/sasw01.html or contact .

Please note that this newsitem has been archived, and may contain outdated information or links.