首页 | 本学科首页   官方微博 | 高级检索  
     


Irreducibility testing over local fields
Authors:P. G. Walsh.
Affiliation:Department of Mathematics, University of Ottawa, Ontario, Canada
Abstract:

The purpose of this paper is to describe a method to determine whether a bivariate polynomial with rational coefficients is irreducible when regarded as an element in $mathbf{Q}((x))[y]$, the ring of polynomials with coefficients from the field of Laurent series in $x$ with rational coefficients. This is achieved by computing certain associated Puiseux expansions, and as a result, a polynomial-time complexity bound for the number of bit operations required to perform this irreducibility test is computed.

Keywords:Algebraic function   Puiseux expansion   irreducibility testing   computational complexity   local field
点击此处可从《Mathematics of Computation》浏览原始摘要信息
点击此处可从《Mathematics of Computation》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号