BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:NP search problems: Complexity and reducibilities - Buss\, S (Univ
 ersity of California\, San Diego)
DTSTART:20120328T103000Z
DTEND:20120328T113000Z
UID:TALK37134@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:This is the first of two tutorial talks on total NP search pro
 blems. Full abstract not yet available.\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR
