Normal projection: deterministic and probabilistic algorithms
From MaRDI portal
Publication:2258914
DOI10.1007/s11464-013-0349-zzbMath1327.13034OpenAlexW2149488961MaRDI QIDQ2258914
Dong-Mei Li, Wei-jun Liu, Jin-wang Liu
Publication date: 27 February 2015
Published in: Frontiers of Mathematics in China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11464-013-0349-z
Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Polynomials over commutative rings (13B25) Ideals in associative algebras (16D25)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approach to the zero recognition problem by Buchberger algorithm
- Minimal primary decomposition and factorized Gröbner bases
- Computing the primary decomposition of zero-dimensional ideals
- The \(\lambda \)-Gröbner bases under polynomial composition
- Further results on homogeneous Gröbner bases under composition
- Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic
- Homogeneous Gröbner bases under composition
- Primary decomposition of zero-dimensional ideals over finite fields
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Factoring multivariate polynomials via partial differential equations
- A new approach to primary decomposition
This page was built for publication: Normal projection: deterministic and probabilistic algorithms