194 search results - page 12 / 39 » Better polynomials for GNFS |
CORR
2011
Springer
13 years 1 months ago
2011
Springer
The AdaBoost algorithm was designed to combine many “weak” hypotheses that perform slightly better than random guessing into a “strong” hypothesis that has very low error....
CSR
2011
Springer
13 years 1 months ago
2011
Springer
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
IACR
2011
12 years 9 months ago
2011
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
DISCO
1993
14 years 1 months ago
1993
The fastest known algorithms in classical algebra make use of signature functions. That is, reducing computation with formulae to computing with the integers modulo p, by substitut...
STACS
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...