BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Concrete Computational Complexity Measures
DTSTART:20230711T160000
DTEND:20230711T180000
DTSTAMP:20260407T230636Z
UID:5a908fed87356d6d1b89983e5d26e3c53b68056bcb0d754868ad5015
CATEGORIES:Conferences - Seminars
DESCRIPTION:Artur Riazanov\nEDIC candidacy exam\nExam president: Prof. Ola
  Svensson\nThesis advisor: Prof. Mika Göös\nCo-examiner: Prof. Michael K
 apralov\n\nAbstract\nA sunflower with p petals consists of p sets whose pa
 irwise intersections are identical. Erdos and Rado proved that every famil
 y of k-element sets of size at least k! (p - 1)^k contains a sunflower of 
 size p. In this write-up we discuss the recent improvement of the Erdos-Ra
 do sunflower lemma [Rao19] and two [CKR20\,LMMPZ22] of its many applicatio
 ns to theoretical computer science.\n\nBackground papers\n\n	Lifting with 
 Sunflowers https://www.cs.toronto.edu/~mertz/papers/lmmpz20.lifting_with_s
 unflowers.pdf [excluding section 7]\n	Coding for Sunflowers https://arxiv.
 org/pdf/1909.04774.pdf [sections 1-3]\n	Monotone Circuit Lower Bounds from
  Robust Sunflowers https://arxiv.org/pdf/2012.03883.pdf\n
LOCATION:BC 129 https://plan.epfl.ch/?room==BC%20129
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR