Previous Conferences & Workshops

For a set of polynomials F, we define their bilinear complexity as the smallest k so that F lies in an ideal generated by k bilinear polynomials. The main open problem is to estimate the bilinear complexity of the single polynomial $\sum_{i,j}x_i^2...

The random loop representations of Toth ('93) and Aizenman-Nachtergaele ('94) can be extended to describe certain SU(2)-invariant spin-1 Heisenberg models. Quantum spin correlations are given in terms of loop correlations. Existence of long-range...

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)...