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:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20201101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6833d33ea78c9
DTSTART;TZID=America/Toronto:20201123T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20201123T113000
URL:/combinatorics-and-optimization/events/algebraic-gr
 aph-theory-seminar-nathan-lindzey-3
SUMMARY:Algebraic Graph Theory Seminar - Nathan Lindzey
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Complexity Measures on the Symmetric Group 
 and Beyond\n\nSpeaker:\n Nathan Lindzey\n\nAffiliation:\n CU Boulder\n\nZo
 om:\n Contact Soffia Arnadottir\n\nABSTRACT:\n\nA classical result in comp
 lexity theory states that a degree-d Boolean\nfunction on the hypercube ca
 n be computed using a decision tree of\ndepth poly(d). Conversely\, a Bool
 ean function computed by a decision\ntree of depth d has degree at most d.
  Thus degree and decision tree\ncomplexity are polynomially related. Many 
 other complexity measures of\nBoolean functions on the hypercube are polyn
 omially related to the\ndegree (e.g.\, approximate degree\, certificate co
 mplexity\, block\nsensitivity)\, and last year Huang famously added sensit
 ivity to the\nlist. Can we prove similar results for Boolean functions on 
 other\ncombinatorial domains?\n 
DTSTAMP:20250526T023438Z
END:VEVENT
END:VCALENDAR