Irreducibility testing over local fields
From MaRDI portal
Publication:4955868
DOI10.1090/S0025-5718-00-01247-3zbMath1042.12005OpenAlexW2020806681MaRDI QIDQ4955868
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
Related Items
On the complexity of analyticity in semi-definite optimization, Computing all integer solutions of a genus 1 equation, A Polynomial Time Complexity Bound for Computations on Curves
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm for computing the values of the ramification index in the Puiseux series expansions of an algebraic function
- Factoring polynomials with rational coefficients
- Irreducibility criterion for germs of analytic functions of two complex variables
- Determination of Bounds for the Solutions to those Binary Diophantine Equations that Satisfy the Hypotheses of Runge's Theorem
- Factoring Polynomials over Algebraic Number Fields
- A quantitative version of Runge's theorem on diophantine equations
- All Algebraic Functions Can Be Computed Fast