• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Foundations of computational mathematics >Improved Complexity Bounds for Counting Points on Hyperelliptic Curves
【24h】

Improved Complexity Bounds for Counting Points on Hyperelliptic Curves

机译：Improved Complexity Bounds for Counting Points on Hyperelliptic Curves

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相关主题

摘要

We present a probabilistic Las Vegas algorithm for computing the local zeta function of a hyperelliptic curve of genus g defined over Fq. It is based on the approaches by Schoof and Pila combined with a modelling of the -torsion by structured polynomial systems. Our main result improves on previously known complexity bounds by showing that there exists a constant c>0 such that, for any fixed g, this algorithm has expected time and space complexity O((logq)cg) as q grows and the characteristic is large enough.

著录项

获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号