BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Libor Barto (Charles University in Prague)
DTSTART:20210524T063000Z
DTEND:20210524T073000Z
DTSTAMP:20260423T052925Z
UID:SiN/20
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/SiN/20/">CSP
 s and Symmetries</a>\nby Libor Barto (Charles University in Prague) as par
 t of Symmetry in Newcastle\n\n\nAbstract\nHow difficult is to solve a give
 n computational problem? In a large class of computational problems\, incl
 uding the fixed-template Constraint Satisfaction Problems (CSPs)\, this fu
 ndamental question has a simple and beautiful answer: the more symmetrical
  the problem is\, the easier is to solve it. The tight connection between 
 the complexity of a CSP and a certain concept that captures its symmetry h
 as fueled much of the progress in the area in the last 20 years. I will ta
 lk about this connection and some of the many tools that have been used to
  analyze the symmetries. The tools involve rather diverse areas of mathema
 tics including  algebra\, analysis\, combinatorics\, logic\, probability\,
  and topology.\n
LOCATION:https://researchseminars.org/talk/SiN/20/
END:VEVENT
END:VCALENDAR