10608 search results - page 238 / 2122 » Complexity of O'Hara's Algorithm |
CORR
2004
Springer
15 years 9 days ago
2004
Springer
We propose a new GCD algorithm called Accelerated Euclidean Algorithm, or AEA for short, which matches the O(n log2 n log log n) time complexity of the Sch
116
click to vote
MOC
2002
15 years 3 days ago
2002
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
117
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our resu...
64
Voted
EDBT
2009
ACM
15 years 5 months ago
2009
ACM
A view selection algorithm takes as input a fact table and computes a set of views to store in order to speed up queries. The performance of view selection algorithm is usually me...
96
Voted
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract— Space Division Multiple Access (SDMA) is a promising solution to improve the spectral efficiency of future mobile radio systems. However, finding the group of MSs tha...