36781 search results - page 90 / 7357 » Parameterizing by the Number of Numbers |
180
click to vote
CHES
2000
Springer
15 years 10 months ago
2000
Springer
The generation of prime numbers underlies the use of most public-key schemes, essentially as a major primitive needed for the creation of key pairs or as a computation stage appear...
177
click to vote
FPGA
2000
ACM
15 years 10 months ago
2000
ACM
The fastest known algorithms for factoring large numbers share a core sieving technique. The sieving cores find numbers that are completely factored over a prime base set raised t...
132
click to vote
CSC
2006
15 years 8 months ago
2006
An addition chain for a natural number n is a sequence 1 = a0 < a1 < . . . < ar = n of numbers such that for each 0 < i r, ai = aj + ak for some 0 k j < i. Thurbe...
177
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
174
click to vote
EM
2010
15 years 6 months ago
2010
On the punctured torus the number of essential self-intersections of a homotopy class of closed curves is bounded (sharply) by a quadratic function of its combinatorial length (th...