Indistinguishability in Counting Logics and the Complexity of Semi-Algebraic Proofs
Seminar Room 1, Newton Institute
AbstractThe 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.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.