194 search results - page 5 / 39 » Better polynomials for GNFS |
TON
2008
13 years 9 months ago
2008
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
APPROX
2007
Springer
14 years 3 months ago
2007
Springer
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
FSE
2011
Springer
13 years 1 months ago
2011
Springer
Hamsi is one of the 14 second-stage candidates in NIST’s SHA-3 competition. The only previous attack on this hash function was a very marginal attack on its 256-bit version publi...
MOC
2010
13 years 4 months ago
2010
In this paper, a Jacobi-collocation spectral method is developed for Volterra integral equations of the second kind with a weakly singular kernel. We use some function transformati...
RECOMB
1997
Springer
14 years 1 months ago
1997
Springer
We present a new polynomial time approximation scheme (PTAS) for tree alignment, which is an important variant of multiple sequence alignment. As in the existing PTASs in the liter...