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:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20171105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d58edab6702
DTSTART;TZID=America/Toronto:20180718T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20180718T133000
URL:https://uwaterloo.ca/computer-science/events/seminar-algorithms-and-com
 plexity-additive-number-theory
LOCATION:DC - William G. Davis Computer Research Centre 200 University Aven
 ue West 1304 Waterloo ON N2L 3G1 Canada
SUMMARY:Seminar • Algorithms and Complexity— Additive Number Theory via
 \nApproximation by Regular Languages
CLASS:PUBLIC
DESCRIPTION:FINN LIDBETTER\, MASTER’S CANDIDATE\n_David R. Cheriton Schoo
 l of Computer Science_\n\nThe fundamental problem of additive number theor
 y is to determine\nwhether there exists an integer m such that every nonne
 gative integer\n(resp.\, every sufficiently large nonnegative integer) is 
 the sum of at\nmost m elements of S. If so\, we call S an additive basis o
 f order m\n(resp.\, an asymptotic additive basis of order m). If such an m
  exists\,\nwe also want to find the smallest such m.
DTSTAMP:20260407T231018Z
END:VEVENT
END:VCALENDAR