Primary decomposition of zero-dimensional ideals over finite fields
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1726532 (Why is no real title available?)
- scientific article; zbMATH DE number 1206418 (Why is no real title available?)
- scientific article; zbMATH DE number 1222356 (Why is no real title available?)
- scientific article; zbMATH DE number 1302473 (Why is no real title available?)
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- scientific article; zbMATH DE number 217454 (Why is no real title available?)
- scientific article; zbMATH DE number 1421059 (Why is no real title available?)
- scientific article; zbMATH DE number 3265895 (Why is no real title available?)
- scientific article; zbMATH DE number 3056446 (Why is no real title available?)
- A new approach to primary decomposition
- A new efficient factorization algorithm for polynomials over small finite fields
- Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman
- Computing the primary decomposition of zero-dimensional ideals
- Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic
- Direct methods for primary decomposition
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Factoring Polynomials Over Large Finite Fields
- Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases
- Factoring multivariate polynomials via partial differential equations
- Factoring polynomials and the knapsack problem
- Gröbner bases and primary decomposition of polynomial ideals
- Localization and primary decomposition of polynomial ideals
- Mechanical theorem proving in geometries. Basic principles. Transl. from the Chinese by Xiaofan Jin and Dongming Wang
- Minimal primary decomposition and factorized Gröbner bases
- On the Lasker-Noether Decomposition Theorem
- Sharp precision in Hensel lifting for bivariate polynomial factorization
Cited in
(13)- Computing and using minimal polynomials
- Computing the primary decomposition of zero-dimensional ideals
- A finite classification of \((x, y)\)-primary ideals of low multiplicity
- Efficient algorithms for finite \(\mathbb{Z}\)-algebras
- Evaluation techniques for zero-dimensional primary decomposition
- Normal projection: deterministic and probabilistic algorithms
- scientific article; zbMATH DE number 5990116 (Why is no real title available?)
- scientific article; zbMATH DE number 1860723 (Why is no real title available?)
- The decision of prime and primary ideal
- Decomposing polynomial sets into simple sets over finite fields: the positive-dimensional case
- Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case
- An efficient algorithm for factoring polynomials over algebraic extension field
- On general primary decomposition for zero-dimensional ideals
This page was built for publication: Primary decomposition of zero-dimensional ideals over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055105)
