Enhancing the Extended Hensel Construction by Using Gröbner Bases
From MaRDI portal
Recommendations
- Enhancing the extended hensel construction by using Gröbner basis
- Grobner bases and extension of scalars
- Publication:3470575
- scientific article; zbMATH DE number 4069044
- An alternative approach to comprehensive Gröbner bases
- scientific article; zbMATH DE number 2151243
- On the construction of Gröbner bases using syzygies
- Gröbner bases applied to finitely generated field extensions
- Constructing Gröbner bases for Noetherian rings
- The enriched Grothendieck construction
Cites work
- A study of Hensel series in general case
- Algorithms for the non-monic case of the sparse modular GCD algorithm
- An Improved Multivariate Polynomial Factoring Algorithm
- Factoring Multivariate Polynomials Over the Integers
- Factorization of multivariate polynomials by extended Hensel construction
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Hensel construction of F(x, u 1 , ..., x l ) l ≥ 2 at a singular point and its applications
- scientific article; zbMATH DE number 3941661 (Why is no real title available?)
- scientific article; zbMATH DE number 3977110 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 3757697 (Why is no real title available?)
- Solving multivariate algebraic equation by Hensel construction
Cited in
(8)- A new algorithm for computing the extended Hensel construction of multivariate polynomials
- On the extended Hensel construction and its application to the computation of real limit points
- Enhancing the extended hensel construction by using Gröbner basis
- On the extended Hensel construction and its application to the computation of limit points
- Factorization of multivariate polynomials by extended Hensel construction
- Improvement of EZ-GCD algorithm based on extended hensel construction
- A Bridge between Euclid and Buchberger: (An Attempt to Enhance Gröbner Basis Algorithm by PRSs and GCDs)
- On the complexity and parallel implementation of Hensel's lemma and Weierstrass preparation
This page was built for publication: Enhancing the Extended Hensel Construction by Using Gröbner Bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830021)