skip to content
 

Complexity of computations and proofs and pseudo-finite structures

Presented by: 
J Krajicek Charles University, Prague
Date: 
Monday 26th March 2012 - 09:30 to 10:30
Venue: 
INI Seminar Room 1
Abstract: 
Problems to establish lower bounds for circuit size or for lengths of propositional proofs can be formulated as problems to construct expansions of pseudo-finite structures. I will explain this relation, give a few examples, and discuss some recent work aimed at proof complexity.
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons