Irreducibility testing over local fields
From MaRDI portal
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
Cites work
- A quantitative version of Runge's theorem on diophantine equations
- All Algebraic Functions Can Be Computed Fast
- An algorithm for computing the values of the ramification index in the Puiseux series expansions of an algebraic function
- 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
- Factoring polynomials with rational coefficients
- scientific article; zbMATH DE number 3858405 (Why is no real title available?)
- scientific article; zbMATH DE number 4037047 (Why is no real title available?)
- scientific article; zbMATH DE number 3785004 (Why is no real title available?)
- scientific article; zbMATH DE number 15339 (Why is no real title available?)
- scientific article; zbMATH DE number 66619 (Why is no real title available?)
- scientific article; zbMATH DE number 3011758 (Why is no real title available?)
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- scientific article; zbMATH DE number 3342122 (Why is no real title available?)
- scientific article; zbMATH DE number 3059981 (Why is no real title available?)
- Irreducibility criterion for germs of analytic functions of two complex variables
Cited in
(7)- On the structure of the irreducible polynomials over local fields
- An irreducibility test for polynomials whose coefficients are algebraic integers
- [[:Publication:2149947|A quasi-linear irreducibility test in \(\mathbb{K}x[y]\)]]
- A Polynomial Time Complexity Bound for Computations on Curves
- scientific article; zbMATH DE number 682071 (Why is no real title available?)
- Computing all integer solutions of a genus 1 equation
- On the complexity of analyticity in semi-definite optimization
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)