On testing a bivariate polynomial for analytic reducibility

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

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

zbMATH Keywords

bivariate polynomialanalytic reducibility

Mathematics Subject Classification ID

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

Cited In (3)

• Approximated roots, generating sequences, sufficiency of jets
• Series-Expansion of Multivariate Algebraic Functions at Singular Points: Nonmonic Case
• An approach to plane algebroid branches

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Reducibility of polynomials in several variables. II 👍 👎
• A heuristic irreducibility test for univariate polynomials 👍 👎
• Analysis of Ben-Or's polynomial irreducibility test 👍 👎
• An irreducibility test for polynomials whose coefficients are algebraic integers 👍 👎
• A family of tests for irreducibility of polynomials 👍 👎
• Analysis of Rabin's irreducibility test for polynomials over finite fields 👍 👎

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)