The \(\lambda \)-Gröbner bases under polynomial composition
From MaRDI portal
Publication:2425845
DOI10.1007/s11424-007-9059-5zbMath1135.13306MaRDI QIDQ2425845
Dong-Mei Li, Xiao-song Chen, Jin-wang Liu
Publication date: 7 May 2008
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-007-9059-5
90C26: Nonconvex programming, global optimization
13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
Related Items
Cites Work
- Unnamed Item
- Groebner basis under composition. I
- Reduced Gröbner bases under composition
- The tangent cone algorithm and homogenization
- The term orderings which are compatible with composition. II.
- Advances and improvements in the theory of standard bases and syzygies
- Homogeneous Gröbner bases under composition
- Remarks on Gröbner basis for ideals under composition