1730 search results - page 93 / 346 » Algebra and Computation |
79
Voted
ANTS
2004
Springer
15 years 6 months ago
2004
Springer
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...
100
Voted
PVM
1997
Springer
15 years 4 months ago
1997
Springer
The traditional approach to the parallelization of linear algebra algorithms such as matrix multiplication and LU factorization calls for static allocation of matrix blocks to proc...
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our wo...
101
click to vote
ICPR
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper we apply the classic theory of Harmonic Analysis and the Conformal Geometric Algebra (CGA) to evaluate the Fourier transform on the unit sphere S2 and on the rotatio...
93
Voted
SODA
2010
ACM
15 years 10 months ago
2010
ACM
We present a new optimization technique that yields the first FPTAS for several geometric problems. These problems reduce to optimizing a sum of non-negative, constant description...