BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20260601T205823EDT-5529DbFfCE@132.216.98.100
DTSTAMP:20260602T005823Z
DESCRIPTION: \n\nSpeaker\n	Alexander Brandts-Longtin\n\n \n\nTopic\n	Complexi
 ty Theory: NP completeness and reduction of problems.\n\nI will define the
  complexity classes P\, NP\, NP-complete\, and\n	NP-hard and show that many
  natural problems belong to\n	these classes. I will also discuss reductions
  between problems\,\n	and show that some hard problems can be approximated
 \n	while others cannot.\n
DTSTART:20170407T170000Z
DTEND:20170407T170000Z
LOCATION:1025 (10th Floor) - Graduate Lounge\, Burnside Hall\, CA\, QC\, Mo
 ntreal\, H3A 0B9\, 805 rue Sherbrooke Ouest
SUMMARY:Math and Stats Graduate Student Seminar
URL:/mathstat/channels/event/math-and-stats-graduate-s
 tudent-seminar-267247
END:VEVENT
END:VCALENDAR