BEGIN:VCALENDAR
VERSION:2.0
PRODID:www.dresden-science-calendar.de
METHOD:PUBLISH
CALSCALE:GREGORIAN
X-MICROSOFT-CALSCALE:GREGORIAN
X-WR-TIMEZONE:Europe/Berlin
BEGIN:VTIMEZONE
TZID:Europe/Berlin
X-LIC-LOCATION:Europe/Berlin
BEGIN:DAYLIGHT
TZNAME:CEST
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
DTSTART:19810329T030000
RRULE:FREQ=YEARLY;INTERVAL=1;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:CET
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
DTSTART:19961027T030000
RRULE:FREQ=YEARLY;INTERVAL=1;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:DSC-9123
DTSTART;TZID=Europe/Berlin:20150424T131500
SEQUENCE:1428593711
TRANSP:OPAQUE
DTEND;TZID=Europe/Berlin:20150424T141500
URL:https://www.dresden-science-calendar.de/calendar/en/detail/9123
LOCATION:TUD Willers-Bau\, Zellescher Weg 12-1401069 Dresden
SUMMARY:Olschewski: Complexity Bounds For Arithmetic Nets And Some Related 
 Problems
CLASS:PUBLIC
DESCRIPTION:Speaker: Thomas Olschewski\nInstitute of Speaker: TU Dresden\nT
 opics:\nMathematik\n Location:\n  Name: TUD Willers-Bau (WIL C 115)\n  Str
 eet: Zellescher Weg 12-14\n  City: 01069 Dresden\n  Phone: \n  Fax: \nDesc
 ription: Determining the number of rational operations it takes to evaluat
 e polynomials is a classical problem of algebraic complexity theory. Many 
 lower and (somewhat fewer) upper bounds have been derived since the early 
 1970s which differ in coefficient field K\, set of operations (division fr
 ee or not ...)\, cost measure (non-scalar\, multiplicative\, additive\, ti
 me-space tradeoff ...). For several types of polynomials evaluation comple
 xity has been determined up to some constant factor\, for some even exactl
 y. For algebraically closed fields K the known methods for deriving lower 
 bounds are mostly of an algebraic nature. In case of the binary field\, co
 unting methods and advanced proof methods have been employed for deriving 
 lower and upper bounds. Subject of this talk are methods for proving lower
  bounds for arithmetic nets and some more recent results.
DTSTAMP:20260721T052542Z
CREATED:20150409T153511Z
LAST-MODIFIED:20150409T153511Z
END:VEVENT
END:VCALENDAR