BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//jEvents 2.0 for Joomla//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:STANDARD
DTSTART:20201208T170000
RDATE:20210314T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20211107T010000
RDATE:20220313T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20221106T010000
RDATE:20230312T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20231105T010000
RDATE:20240310T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20241103T010000
RDATE:20250309T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20251102T010000
RDATE:20260308T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20261101T010000
RDATE:20270314T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20271107T010000
RDATE:20280312T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20281105T010000
RDATE:20290311T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20210314T030000
RDATE:20211107T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20220313T030000
RDATE:20221106T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20230312T030000
RDATE:20231105T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20240310T030000
RDATE:20241103T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20250309T030000
RDATE:20251102T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20260308T030000
RDATE:20261101T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20270314T030000
RDATE:20271107T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20280312T030000
RDATE:20281105T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:d34a2e902b256c469174e255536f863f
CATEGORIES:Experimental Mathematics Seminar
CREATED:20211129T095035
SUMMARY:Experimental Complexity Theory?
LOCATION:Zoom
DESCRIPTION:Abstract: Complexity theory is generally a two-handed piece between the upp
 er bound O(f(n)) algorithm designers and the lower bound ?(f(n)) example bu
 ilders. If they agree, we're in ?(f(n)) paradise. Implicit in this is "wors
 t case''. Only rarely does "average case'' complexity get mentioned, not le
 ast because even defining "average case'' is hard. What the user of an algo
 rithm is really interested in, of course, is "complexity on my problems''. 
 Failing this, we could at least ask for "complexity on typical problems'', 
 which raises "what is typical''. This is normally answered by having a coll
 ection of typical problems, something many fields (e.g. my own computer alg
 ebra) are pretty poor at. I will contrast this with the situation in SAT-so
 lving, and finish with some ideas for the future.\n
X-ALT-DESC;FMTTYPE=text/html:<p>Abstract: Complexity theory is generally a two-handed piece between the 
 upper bound O(f(n)) algorithm designers and the lower bound ?(f(n)) example
  builders. If they agree, we're in ?(f(n)) paradise. Implicit in this is "w
 orst case''. Only rarely does "average case'' complexity get mentioned, not
  least because even defining "average case'' is hard. What the user of an a
 lgorithm is really interested in, of course, is "complexity on my problems'
 '. Failing this, we could at least ask for "complexity on typical problems'
 ', which raises "what is typical''. This is normally answered by having a c
 ollection of typical problems, something many fields (e.g. my own computer 
 algebra) are pretty poor at. I will contrast this with the situation in SAT
 -solving, and finish with some ideas for the future.</p>
CONTACT:James Davenport, Univeristy of Bath, UK
X-EXTRAINFO:Zoom Link: https://rutgers.zoom.us/j/94346444480\npassword: The 20th Catala
 n number, alias (40)!/(20!*21!), alias 6564120420
DTSTAMP:20260827T152221
DTSTART;TZID=America/New_York:20211209T170000
DTEND;TZID=America/New_York:20211209T180000
SEQUENCE:0
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR