An Efficient Implementation for Computing Gröbner Bases over Algebraic Number Fields

DOI10.1007/11832225_9zbMath1230.13027OpenAlexW1538583102MaRDI QIDQ5747802

Masayuki Noro

Publication date: 14 September 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11832225_9

zbMATH Keywords

Buchberger's algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (1)

On singularities of real algebraic sets and applications to kinematics

Uses Software

• Risa/Asir

This page was built for publication: An Efficient Implementation for Computing Gröbner Bases over Algebraic Number Fields