Title of article :
A POLYNOMIAL TIME COMPLEXITY BOUND FOR COMPUTATIONS ON CURVES
Author/Authors :
WALSH، P. G. نويسنده , , curves، algebraic نويسنده , , genus، نويسنده , , expa.nsion، Puiseux نويسنده , , complexity، نويسنده ,
Issue Information :
دوماهنامه با شماره پیاپی سال 1999
Abstract :
This paper describes the potential suitability of a new family of concrete mixtures for use in protective structures. Two very-high-strength concrete mixtures are discussed and experimental results of penetration studies on one of these are presented. The results are compared to penetration-study results of other, more conventional concrete mixtures, and the advantages of the very-high-strength mixtures are described.
Keywords :
fast exponentiation , cryptography , Compression , discrete-log
Journal title :
SIAM Journal on Computing
Journal title :
SIAM Journal on Computing