scientific article; zbMATH DE number 5375015
zbMATH Open1164.65317MaRDI QIDQ3542151FDOQ3542151
Authors: Alexandru Bobe 
Publication date: 28 November 2008
Full work available at URL: https://eudml.org/doc/130255
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 3941661
- scientific article; zbMATH DE number 3899033
- An algorithm for computing a Gröbner basis of a polynomial ideal over a ring with zero divisors
- A Gröbner basis algorithm for ideals over zero-dimensional valuation rings
- A simple algorithm for principalization of monomial ideals
- Algorithms for computing multiplier ideals
- An algorithm for the computation of the radical of an ideal
- A signature-based algorithm for computing Gröbner bases over principal ideal domains
- An algorithm for Hodge ideals
- scientific article; zbMATH DE number 2102751
algorithmscomputational geometryprincipal idealcomputational commutative algebracomputer algebra systemGröbner basisGröbner regionideal of a polynomial ringSingular 3.0
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cited In (7)
- Real radical initial ideals
- A simple algorithm for principalization of monomial ideals
- Computing Gröbner bases of ideals of few points in high dimensions
- Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
- Ideal-specific elimination orders form a star-shaped region
- A symbolic algorithm for parameterizing a prime ideal
- A study of the relationship between competitiveness and technological innovation capability based on DEA models
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3542151)
