• 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
  • Pages
    -703
  • From page
    704
  • To page
    0
  • 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
    Compression , fast exponentiation , cryptography , discrete-log
  • Journal title
    SIAM Journal on Computing
  • Serial Year
    1999
  • Journal title
    SIAM Journal on Computing
  • Record number

    16495

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=16495