The algebraic models of computation for contextual nets that have been proposed in the literature either rely on a non-free monoid of objects, or introduce too many fictitious beh...
We prove old and new results on the complexity of computing the dimension of algebraic varieties. In particular, we show that this problem is NP-complete in the Blum-Shub-Smale mo...
In this paper, we analyse the algebraic immunity of symmetric Boolean functions. We identify a set of lowest degree annihilators for symmetric functions and propose an efficient al...
Empirical studies on link blacklisting show that the delivery rate is very sensitive to the calibration of the blacklisting threshold. If the calibration is too restrictive (the th...
Flavio Fabbri, Marco Zuniga, Daniele Puccinelli, P...