Irreducibility testing over local fields

DOI10.1090/S0025-5718-00-01247-3zbMATH Open1042.12005OpenAlexW2020806681MaRDI QIDQ4955868FDOQ4955868

Authors: P. G. Walsh 

Publication date: 22 May 2000

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

Full work available at URL: https://doi.org/10.1090/s0025-5718-00-01247-3

Recommendations

• [[:Publication:2149947|A quasi-linear irreducibility test in \(\mathbb{K}x[y]\)]]
• Irreducibility criterion over finite fields
• An irreducibility test for polynomials whose coefficients are algebraic integers
• On the structure of the irreducible polynomials over local fields
• Irreducibility of multivariate polynomials

Mathematics Subject Classification ID

Polynomials in general fields (irreducibility, etc.) (12E05)

Cites Work

• Factoring polynomials with rational coefficients
• Title not available (Why is that?)
• A quantitative version of Runge's theorem on diophantine equations
• Title not available (Why is that?)
• All Algebraic Functions Can Be Computed Fast
• Title not available (Why is that?)
• Title not available (Why is that?)
• Factoring Polynomials over Algebraic Number Fields
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Irreducibility criterion for germs of analytic functions of two complex variables
• Title not available (Why is that?)
• Determination of Bounds for the Solutions to those Binary Diophantine Equations that Satisfy the Hypotheses of Runge's Theorem
• An algorithm for computing the values of the ramification index in the Puiseux series expansions of an algebraic function
• Title not available (Why is that?)

Cited In (7)

• [[Publication:2149947|A quasi-linear irreducibility test in \(\mathbb{K}x[y]\)]]
• An irreducibility test for polynomials whose coefficients are algebraic integers
• A Polynomial Time Complexity Bound for Computations on Curves
• On the structure of the irreducible polynomials over local fields
• Computing all integer solutions of a genus 1 equation
• On the complexity of analyticity in semi-definite optimization
• Title not available (Why is that?)

This page was built for publication: Irreducibility testing over local fields

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