BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260921T003259Z
UID:Seminar-dept-455@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20180116T130000
DTEND:20180116T140000
SUMMARY:School Seminar Series
DESCRIPTION:Prof. Paul Goldberg: TFNP: An Update\n\nThe complexity class TFNP comprises problems in which every instance\n\nhas an easily-checkable solution. There are many and varied TFNP problems\n\nthat seem to be computationally hard, but NP-hardness is unlikely,\n\nand instead we rely on a diverse set of alternative notions of hardness.\n\nWe show how TFNP problems can be expressed in terms of proofs in\n\nformal logic, in a way that's specific to TFNP. This provides a\n\nunifying framework that leads to new and interesting challenges\n\nthat generalise existing known TFNP problems.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=455
LOCATION:Ashton Lecture Theater
END:VEVENT
END:VCALENDAR