BEGIN:VCALENDAR
VERSION:2.0
PRODID:ILLC Website
X-WR-TIMEZONE:Europe/Amsterdam
BEGIN:VTIMEZONE
TZID:Europe/Amsterdam
X-LIC-LOCATION:Europe/Amsterdam
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700329T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701025T030000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:/NewsandEvents/Archives/2012/newsitem/4158/26-
30-March-2012-Newton-Institute-Workshop-Logical-Ap
proaches-to-Barriers-in-Complexity-II-Cambridge-U-
K-
DTSTAMP:20111026T000000
SUMMARY:Newton Institute Workshop "Logical Approac
hes to Barriers in Complexity II", Cambridge, U.K.
DTSTART;VALUE=DATE:20120326
DTEND;VALUE=DATE:20120330
LOCATION:Cambridge, U.K.
DESCRIPTION:Computational complexity theory has it
s origin in logic. The fundamental goal of this ar
ea is to understand the limits of efficient comput
ation and the sources of intractability. The most
famous open problem in the area is the P = NP-prob
lem, listed among the seven Clay Millenium Prize p
roblems. Logic provides a multifarious toolbox of
techniques to analyse questions like this, some of
which promise to provide deep insights in the nat
ure and limits of efficient computation. In our wo
rkshop, we shall focus on logical descriptions of
complexity, i.e. descriptive complexity, propositi
onal proof complexity and bounded arithmetic. The
workshop will bring together leading researchers
covering all research areas within the scope of th
e workshop. We will especially focus on work that
draws on methods from the different areas which ap
peal to the whole community. Deadline for applic
ation for participation: 26th January 2012 For mor
e information, see http://www.newton.ac.uk/program
mes/SAS/sasw01.html or contact a.beckmann at swans
ea.ac.uk.
X-ALT-DESC;FMTTYPE=text/html:\n Computatio
nal complexity theory has its origin in logic. The
\n fundamental goal of this area is to unders
tand the limits of\n efficient computation an
d the sources of intractability. The\n most f
amous open problem in the area is the P = NP-probl
em,\n listed among the seven Clay Millenium P
rize problems. Logic\n provides a multifario
us toolbox of techniques to analyse\n questio
ns like this, some of which promise to provide dee
p\n insights in the nature and limits of effi
cient computation. In\n our workshop, we sha
ll focus on logical descriptions of\n complex
ity, i.e. descriptive complexity, propositional pr
oof\n complexity and bounded arithmetic.

\
n The workshop will bring together leading
researchers covering\n all research areas wi
thin the scope of the workshop. We will\n esp
ecially focus on work that draws on methods from t
he\n different areas which appeal to the whol
e community.\n

\n \n Deadline
for application for participation: 26th January 2
012\n For more information, see\n http://www.newton.ac.uk/p
rogrammes/SAS/sasw01.html\n or contact
a.beckmann at swansea.ac.uk.\n

URL:/NewsandEvents/Archives/2012/newsitem/4158/26-
30-March-2012-Newton-Institute-Workshop-Logical-Ap
proaches-to-Barriers-in-Complexity-II-Cambridge-U-
K-
END:VEVENT
END:VCALENDAR