BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20120311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20111106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6a2260e7885ed
DTSTART;TZID=America/Toronto:20120808T150900
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20120808T150900
URL:https://uwaterloo.ca/pure-mathematics/events/constraint-satisfaction-se
 minar-payne-aug-08-2012
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 50
 46 Waterloo ON N2L 3G1 Canada
SUMMARY:Constraint Satisfaction seminar
CLASS:PUBLIC
DESCRIPTION:IAN PAYNE\, PURE MATHEMATICS DEPARTMENT\, UNIVERSITY OF WATERLO
 O\n\n“DETERMINING CSP COMPLEXITY USING UNIVERSAL ALGEBRA”\n\nGiven a f
 inite relational structure\, A\, the complexity of the\nconstraint satisfa
 ction problem for A can sometimes be determined\nusing universal algebra. 
 There are several known algebraic conditions\non the polymorphism algebra 
 of a structure that imply the\nNP-completeness of its CSP.
DTSTAMP:20260605T053847Z
END:VEVENT
END:VCALENDAR