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/2006/newsitem/1035/20-
24-March-2006-Mathematics-of-constraint-satisfacti
on-Algebra-Logic-and-Graph-Theory-Isaac-Newton-Ins
titute-for-Mathematical-Sciences-Cambridge-UK
DTSTAMP:20051103T000000
SUMMARY:Mathematics of constraint satisfaction: Al
gebra, Logic, and Graph Theory, Isaac Newton Insti
tute for Mathematical Sciences, Cambridge, UK
DTSTART;VALUE=DATE:20060320
DTEND;VALUE=DATE:20060324
LOCATION:Isaac Newton Institute for Mathematical S
ciences, Cambridge, UK
DESCRIPTION:The study of constraint satisfaction p
roblems (CSPs) began in the 1970's in artificial i
ntelligence, where this paradigm is now as popular
as ever, with hundreds of researchers using this
framework to model and solve a wide variety of pro
blems. In 1978, Thomas Schaefer published a semina
l paper on the complexity classification of Boolea
n CSPs, and since then the importance of the CSP i
n theoretical computer science has continued to gr
ow. For example, many standard complete problems f
or standard complexity classes are variants of CSP
s, and some of the first optimal inapproximability
results in combinatorial optimization were proved
for certain CSPs. For more information, see ht
tp://www.comlab.ox.ac.uk/mathscsp/.
X-ALT-DESC;FMTTYPE=text/html:\n \n
The study of constraint satisfaction problems (CSP
s) \n began in the 1970's in artificial int
elligence, where this paradigm is now \n as
popular as ever, with hundreds of researchers usi
ng this framework to \n model and solve a w
ide variety of problems. In 1978, Thomas Schaefer
\n published a seminal paper on the comple
xity classification of Boolean CSPs, \n and
since then the importance of the CSP in theoretic
al computer science \n has continued to gro
w. For example, many standard complete problems fo
r \n standard complexity classes are varia
nts of CSPs, and some of the first \n optim
al inapproximability results in combinatorial opti
mization were proved \n for certain CSPs.\n

\n \n \n For more info
rmation, see\n http://www.coml
ab.ox.ac.uk/mathscsp/.\n

\n
URL:/NewsandEvents/Archives/2006/newsitem/1035/20-
24-March-2006-Mathematics-of-constraint-satisfacti
on-Algebra-Logic-and-Graph-Theory-Isaac-Newton-Ins
titute-for-Mathematical-Sciences-Cambridge-UK
END:VEVENT
END:VCALENDAR