skip to content
 

Indistinguishability in Counting Logics and the Complexity of Semi-Algebraic Proofs

Presented by: 
A Atserias Universitat Politècnica de Catalunya
Date: 
Tuesday 27th March 2012 - 09:00 to 10:00
Venue: 
INI Seminar Room 1
Abstract: 
The recent connection between the concept of indistinguishability by the properties expressible in a certain formal language and a relaxation of structural isomorphism through linear programming brings the areas of descriptive complexity and propositional proof complexity a little bit closer together. In this talk I will overview this connection making emphasis on the questions it has answered, but also on the many new exciting questions that it raises.
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