Previous Conferences & Workshops

We will give an overview of this system, which has been at the center of recent algorithmic and proof complexity developments. We will give the definitions of the system (as a proof system for polynomial inequalities, and as an SDP-based algorithm)...

A symplectic pencil is a linear family of symplectic forms, i.e., a linear space of two-forms, each of which, except of course the zero form, is symplectic. Symplectic pencils arise, for instance, from representations of Clifford algebras and can be...

We consider Galois cohomology groups over function fields F of curves that are defined over a complete discretely valued field. Motivated by work of Kato and others for n=3, we show that local-global principles hold for H^n(F, Z/mZ(n-1)) for all n>1...