scientific article; zbMATH DE number 2166957
From MaRDI portal
Publication:4674258
zbMATH Open1161.13306MaRDI QIDQ4674258FDOQ4674258
Authors: Ferdinando Mora 
Publication date: 9 May 2005
Title of this publication is not available (Why is that?)
Recommendations
Polynomials in number theory (11C08) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Research exposition (monographs, survey articles) pertaining to commutative algebra (13-02)
Cited In (60)
- Axioms for a theory of signature bases
- Oracle-supported drawing of the Gröbner \textit{escalier}
- Local dual spaces and primary decomposition
- Bar code and Janet-like division
- Title not available (Why is that?)
- From grids to pseudo-grids of lines: resolution and seminormality
- Effective algorithm for computing Noetherian operators of zero-dimensional ideals
- Gröbner basis approach to list decoding of algebraic geometry codes
- Toward a theory of monomial preorders
- On the bit complexity of polynomial system solving
- Symmetric decomposition of the associated graded algebra of an Artinian Gorenstein algebra
- Grete Hermann and effective methods in geometry
- Solving polynomial equation systems. Vol. IV. Buchberger theory and beyond
- Improved evaluation codes defined by plane valuations
- A Gröbner free alternative for polynomial system solving
- Standard bases over Euclidean domains
- Zacharias representation of effective associative rings
- Multiple zeros of nonlinear systems
- A survey on signature-based algorithms for computing Gröbner bases
- Generalization of the F5 algorithm for calculating Gröbner bases for polynomial ideals
- F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases
- An algorithmic approach to resolutions
- Title not available (Why is that?)
- An FGLM-like algorithm for computing the radical of a zero-dimensional ideal
- Degree upper bounds for involutive bases
- A new algorithm for computing staggered linear bases
- Dimension and depth dependent upper bounds in polynomial ideal theory
- The scheme of liftings and applications
- Minimal free resolutions of some configurations of fat lines
- Border bases for lattice ideals
- Standard bases in mixed power series and polynomial rings over rings
- The F5 criterion revised
- Segments and Hilbert schemes of points
- A Pommaret bases approach to the degree of a polynomial ideal
- Gröbner bases for polynomial systems with parameters
- Computation of Macaulay constants and degree bounds for Gröbner bases
- Recursive structures in involutive bases theory
- Quantifying the unstable in linearized nonlinear systems
- Smoothable Gorenstein points via marked schemes and double-generic initial ideals
- Flat families by strongly stable ideals and a generalization of Gröbner bases
- HELP: a sparse error locator polynomial for BCH codes
- Ideals, Varieties, and Algorithms
- The approach of moments for polynomial equations
- Gröbner bases and combinatorics for binary codes
- Multivariate polynomial interpolation with perturbed data
- Gröbner bases of Hilbert ideals of alternating groups
- Improved decoding of affine-variety codes
- Using Algebraic Geometry
- Computing an invariant of a linear code
- Involutive bases algorithm incorporating F\(_5\) criterion
- Double-generic initial ideal and Hilbert scheme
- On the use of Buchberger criteria in \(\mathrm G^2\mathrm V\) algorithm for calculating Gröbner bases
- Computing Gröbner bases associated with lattices
- On the construction of staggered linear bases
- Solving polynomial equation systems. Vol. III: Algebraic solving
- Bar code for monomial ideals
- Buchberger-Zacharias theory of multivariate Ore extensions
- Improved Buchberger's algorithm
- Computing Equilibrium Points of Genetic Regulatory Networks
- The generalized Rabinowitsch trick
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 Q4674258)
