On testing a bivariate polynomial for analytic reducibility

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


Let K be an algebraically closed field of characteristic zero. We present an efficient algorithm for determining whether or not a given polynomial f(x, y) in K[x, y] is analytically reducible over K at the origin. The algorithm presented is based upon an informal method sketched by Kuo (1989) which is in turn derived from ideas of Abhyankar (1988). The presentation contained herein emphasises the proofs of the algorithm's correctness and termination, and is suitable for computer implementation. A polynomial worst case time complexity bound is proved for a partial version of the algorithm.

Original languageEnglish
Pages (from-to)509-535
Number of pages27
JournalJournal of Symbolic Computation
Issue number5
Publication statusPublished - Nov 1997


Dive into the research topics of 'On testing a bivariate polynomial for analytic reducibility'. Together they form a unique fingerprint.

Cite this