230 search results - page 4 / 46 » Faster algorithms for the characteristic polynomial |
SODA
2000
ACM
14 years 11 months ago
2000
ACM
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
In the p-Set Splitting problem we are given a universe U, a family F of subsets of U and a positive integer k and the objective is to find a partition of U into W and B such that...
SWAT
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We study the gossiping problem in directed ad-hoc radio networks. Our main result is a deterministic algorithm that solves this problem in an n-node network in time O(n4/...
AAECC
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We present new faster deterministic and probabilistic recombination algorithms to compute the irreducible decomposition of a bivariate polynomial via the classical Hensel...
76
Voted
ESA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...