417 search results - page 71 / 84 » Running Time Predictions for Factoring Algorithms |
PPSC
1997
14 years 11 months ago
1997
It seems likely that improvements in arithmetic speed will continue to outpace advances in communication bandwidth. Furthermore, as more and more problems are working on huge datas...
SPIRE
2010
Springer
14 years 8 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
CPM
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
BMCBI
2008
14 years 9 months ago
2008
Background: We propose a multiple sequence alignment (MSA) algorithm and compare the alignment-quality and execution-time of the proposed algorithm with that of existing algorithm...
SIAMCOMP
2002
14 years 9 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...