BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Almost Certainly Correct - Andrej Ivašković ()
DTSTART:20201127T160000Z
DTEND:20201127T170000Z
UID:TALK154378@talks.cam.ac.uk
CONTACT:Arthur Conmy
DESCRIPTION:Solutions to most competitive programming problems are evaluat
 ed based on whether they return the expected result on a finite set of tes
 t cases. This means that the algorithm you devise need not be perfect. In 
 this talk I will show how we can utilise randomness in designing fast and 
 simple algorithms that are almost guaranteed to solve problems where a per
 fect solution has a very high computational cost.
LOCATION:Venue to be confirmed
END:VEVENT
END:VCALENDAR