848 search results - page 16 / 170 » Randomness and the linear degrees of computability |
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Abstract. The simplex method in Linear Programming motivates several problems of asymptotic convex geometry. We discuss some conjectures and known results in two related directions...
107
click to vote
LATINCRYPT
2010
14 years 10 months ago
2010
Abstract. In this paper, we present an efficient cryptanalysis of the socalled HM cryptosystem which was published at Asiacrypt’1999, and one perturbed version of HM. Until now, ...
JSC
2010
14 years 10 months ago
2010
We show how to compute Hong’s bound for the absolute positiveness of a polynomial in d variables with maximum degree δ in O(n logd n) time, where n is the number of non-zero co...
102
click to vote
WCNC
2010
IEEE
15 years 3 months ago
2010
IEEE
—In this paper, we study node connectivity in multi-hop wireless networks. Nodal degree of connectivity as one of the fundamental graph properties is the basis for the study of n...
91
Voted
RANDOM
1999
Springer
15 years 4 months ago
1999
Springer
We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...