137 search results - page 21 / 28 » Upper Bounds on the Complexity of Some Galois Theory Problem... |
CDC
2009
IEEE
14 years 22 days ago
2009
IEEE
— Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values...
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
ISSAC
1997
Springer
14 years 5 days ago
1997
Springer
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
A sender wishes to broadcast a message of length n over an alphabet of size k to r users, where each user i, 1 i r should be able to receive one of possible mi messages. The cha...
IWMM
2009
Springer
14 years 2 months ago
2009
Springer
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...