Using Gröbner bases for factoring polynomials over algebraic extension fields
From MaRDI portal
Recommendations
Cites work
Cited in
(13)- Using Gröbner bases for detecting polynomial identities: A case study on Fermat's ideal
- Gröbner basis for an ideal of a polynomial ring over an algebraic extension over a field and its applications
- A factorization algorithm for \(G\)-algebras and its applications
- Computation of unirational fields
- A note on Gröbner bases and Berlekamp's algorithm
- scientific article; zbMATH DE number 1714661 (Why is no real title available?)
- A factorization algorithm for G-algebras and applications
- An efficient algorithm for factoring polynomials over algebraic extension field
- scientific article; zbMATH DE number 3968702 (Why is no real title available?)
- scientific article; zbMATH DE number 1253993 (Why is no real title available?)
- Computing minimal polynomial of matrices over algebraic extension fields
- Trager's factorization algorithm over successive extension fields
- Wang-Sun.mpl
This page was built for publication: Using Gröbner bases for factoring polynomials over algebraic extension fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5389511)