In this paper we discuss the use of structured matrix methods for the numerical approximation of the zeros of a univariate polynomial. In particular, it is shown that root-findin...
In this paper, it is shown that the Hilbert series of a Borel type ideal may be computed within a complexity which is polynomial in Dn where n + 1 is the number of unknowns and D ...
An extension of Karr’s summation algorithm is presented by which symbolic sums involving radical expressions can be simplified. We discuss the construction of appropriate diff...
Bipolarity has not been much exploited in the spatial domain yet, although it has many features to manage imprecise and incomplete information that could be interesting in this dom...
— We use a mathematical model based on Brownian motion to analyze the performance of Last Encounter Routing (LER), a routing protocol for ad hoc networks. Our results show that, ...