3208 search results - page 135 / 642 » A Lower Bound for Primality |
209
click to vote
MFCS
2001
Springer
15 years 11 months ago
2001
Springer
We show that it is not possible to approximate the minimum Steiner tree problem within 1 + 1 162 unless RP = NP. The currently best known lower bound is 1 + 1 400. The reduction i...
201
click to vote
COCO
1993
Springer
15 years 10 months ago
1993
Springer
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
171
click to vote
PLDI
1993
ACM
15 years 10 months ago
1993
ACM
This paper shows how to software pipeline a loop for minimal register pressure withoutsacrificing the loop’s minimum execution time. This novel bidirectional slack-scheduling m...
156
click to vote
CRYPTO
2009
Springer
15 years 10 months ago
2009
Springer
The round complexity of interactive protocols is one of their most important complexity measures. In this work we prove that existing lower bounds for the round complexity of VSS c...
147
click to vote
ANTS
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We further analyze the solutions to the Diophantine equations from which prime-order elliptic curves of embedding degrees k = 3, 4 or 6 (MNT curves) may be obtained. We g...