An efficient implementation for computing Gröbner bases over algebraic number fields
From MaRDI portal
Publication:5747802
DOI10.1007/11832225_9zbMATH Open1230.13027OpenAlexW1538583102MaRDI QIDQ5747802FDOQ5747802
Authors: 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
Recommendations
- Gröbner bases in orders of algebraic number fields.
- scientific article; zbMATH DE number 2151220
- Computing Gröbner bases of ideal in \(\mathbb Z[\alpha] [x_1,\cdots, x_n]\) over \(\mathbb Z\)
- scientific article; zbMATH DE number 62658
- A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Cited In (9)
- Dense Arithmetic over Finite Fields with the CUMODP Library
- Title not available (Why is that?)
- Title not available (Why is that?)
- On singularities of real algebraic sets and applications to kinematics
- An Effective Framework for Constructing Exponent Lattice Basis of Nonzero Algebraic Numbers
- Effective computation of strong Gröbner bases over Euclidean domains
- On the Complexity of Linear Algebra Operations over Algebraic Extension Fields
- Title not available (Why is that?)
- Compact representation of polynomials for algorithms for computing Gröbner and involutive bases
Uses Software
This page was built for publication: An efficient implementation for computing Gröbner bases over algebraic number fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5747802)
