...
首页> 外文期刊>Designs, Codes and Crytography >On solving sparse algebraic equations over finite fields
【24h】

On solving sparse algebraic equations over finite fields

机译:关于有限域上的稀疏代数方程组的求解

获取原文
获取原文并翻译 | 示例
           

摘要

A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. In this paper new deterministic algorithms for solving such equations are presented. The mathematical expectation of their running time is estimated. These estimates are at present the best theoretical bounds on the complexity of solving average instances of the above problem. In characteristic 2 the estimates are significantly lower the worst case bounds provided by SAT solvers.
机译:如果每个方程依赖少量变量,则一个有限域上的代数方程组称为稀疏方程组。在本文中,提出了求解此类方程式的新确定性算法。估算了其运行时间的数学期望。目前,这些估计值是解决上述问题的平均情况的复杂性的最佳理论界限。在特征2中,估计值明显低于SAT解算器提供的最坏情况范围。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号