We have proposed new boundary conditions for flat space spin-3 gravity (3)-(6) and flat space higher-spin gravity (59), and have shown that they lead to well defined charges as well as to a novel asymptotic symmetry algebra, (17) and (61), respectiv…

In this paper, we have studied the computational complexity of the constraint problem for weak SPEs. We were able to obtain precise complexities for all the classical classes of ω-regular objectives (see Table 1), with one exception: we have proved …

Theorem 2.2 states that the emptiness problem of weakly synchronizing languages for PAs is undecidable. To show that, we present a reduction from the value 1 problem for PAs which is undecidable [GO10], to our problem.

The work of MD is supported by F.R.S.-FNRS (Belgian National Fund for Scientific Research) through a Research Fellowship. MD and AG acknowledge financial support from the European Research Council under the European Community’s Seventh Framework Pro…

We show that almost all known lower bound methods for communication complexity are also lower bounds for the information complexity. In particular, we define a relaxed version of the partition bound of Jain and Klauck and prove that it lower bounds …