On testing a bivariate polynomial for analytic reducibility

DOI10.1006/JSCO.1997.0150zbMATH Open0895.68073OpenAlexW2016433900MaRDI QIDQ1376578FDOQ1376578

Authors: Scott McCallum 

Publication date: 20 September 1998

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1997.0150

Recommendations

• On the irreducibility of bivariate polynomials
• scientific article; zbMATH DE number 1189231
• scientific article; zbMATH DE number 2151235
• Analysis of Ben-Or's polynomial irreducibility test
• A heuristic irreducibility test for univariate polynomials
• A family of tests for irreducibility of polynomials
• An irreducibility test for polynomials whose coefficients are algebraic integers
• Reducibility of polynomials in several variables. II
• Analysis of Rabin's irreducibility test for polynomials over finite fields

zbMATH Keywords

bivariate polynomialanalytic reducibility

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Formal power series rings (13F25)

Cited In (5)

• Series-expansion of multivariate algebraic functions at singular points: nonmonic case
• [[Publication:4848389|A Simple Algorithm for Deciding Primes in K[[x,y]]]]
• Approximated roots, generating sequences, sufficiency of jets
• [[Publication:2149947|A quasi-linear irreducibility test in \(\mathbb{K}x[y]\)]]
• An approach to plane algebroid branches

This page was built for publication: On testing a bivariate polynomial for analytic reducibility

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1376578)