BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Complexity of computations and proofs and pseudo-finite structures
  - Krajicek\, J (Charles University\, Prague)
DTSTART:20120326T083000Z
DTEND:20120326T093000Z
UID:TALK37090@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:Problems to establish lower bounds for circuit size or for len
 gths of propositional proofs can be formulated as problems to construct ex
 pansions of pseudo-finite structures.\n  I will explain this relation\, gi
 ve a few examples\, and discuss some recent work aimed at proof complexity
 .\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR