首页> 外文期刊>Computational complexity >A QUASI-LINEAR IRREDUCIBILITY TEST IN Kxy
【24h】

A QUASI-LINEAR IRREDUCIBILITY TEST IN Kxy

机译:A QUASI-LINEAR IRREDUCIBILITY TEST IN Kxy

获取原文
           

摘要

We provide an irreducibility test in the ring Kxy whose complexity is quasi-linear with respect to the discriminant valuation, assuming the input polynomial F is square-free and K is a perfect field of characteristic not dividing deg(F). The algorithm uses the theory of approximate roots and may be seen as a generalisation of Abhyankar's irreducibility criterion to the case of non-algebraically closed residue fields.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号