Mora’s holy graal: Algorithms for computing in localizations at prime ideals
From MaRDI portal
Publication:3466807
DOI10.1142/S0218196715500332zbMath1342.13035arXiv1504.01648MaRDI QIDQ3466807
Publication date: 25 January 2016
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.01648
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computational aspects in algebraic geometry (14Q99) Local rings and semilocal rings (13H99)
Related Items (1)
Uses Software
Cites Work
This page was built for publication: Mora’s holy graal: Algorithms for computing in localizations at prime ideals