scientific article; zbMATH DE number 4132308
From MaRDI portal
Publication:3033872
zbMATH Open0692.13012MaRDI QIDQ3033872FDOQ3033872
Authors: Patrizia Gianni, Ferdinando Mora 
Publication date: 1989
Title of this publication is not available (Why is that?)
Recommendations
Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Software, source code, etc. for problems pertaining to commutative algebra (13-04)
Cited In (59)
- Solving determinantal systems using homotopy techniques
- Some examples for solving systems of algebraic equations by calculating Gröbner bases
- The calculation of radical ideals in positive characteristic
- On an implementation of standard bases and syzygies in SINGULAR
- An algorithm for computing Grothendieck local residues. I: Shape basis case
- Title not available (Why is that?)
- Gröbner bases and critical values: the asymptotic combinatorics of determinantal systems
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
- Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences
- Complexity results for triangular sets
- Modular composition modulo triangular sets and applications
- Deterministic normal position transformation and its applications
- Solving parametric systems of polynomial equations over the reals through Hermite matrices
- Some constructions for real algebraic curves
- Root isolation of zero-dimensional polynomial systems with linear univariate representation
- Title not available (Why is that?)
- Bit complexity for computing one point in each connected component of a smooth real algebraic set
- A Gröbner free alternative for polynomial system solving
- Lower bounds for diophantine approximations
- A modular method to compute the rational univariate representation of zero-dimensional ideals
- Title not available (Why is that?)
- Title not available (Why is that?)
- Determinantal formulae for the solution set of zero-dimensional ideals
- A commutative algebra approach to linear codes
- Evaluation properties of invariant polynomials
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization
- Polynomial equation solving by lifting procedures for ramified fibers
- Title not available (Why is that?)
- Computing critical points for invariant algebraic systems
- Computation of real radicals of polynomial ideals. II
- An FGLM-like algorithm for computing the radical of a zero-dimensional ideal
- Fast computation of a rational point of a variety over a finite field
- Deformation techniques for efficient polynomial equation solving.
- Gröbner bases of ideals defined by functionals with an application to ideals of projective points
- Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients
- Solving via modular methods
- Algorithms to compute the topology of orientable real algebraic surfaces
- Rational points and trace forms on a finite algebra over a real closed field
- Comprehensive Gröbner bases
- A new algorithm for discussing Gröbner bases with parameters.
- Guessing Gröbner bases of structured ideals of relations of sequences
- Regular representations of finite-dimensional separable semisimple algebras and Gröbner bases
- Relaxed Hensel lifting of triangular sets
- Noetherian operators and primary decomposition
- Block-Krylov techniques in the context of sparse-FGLM algorithms
- Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph
- Subresultants and the Shape Lemma
- On the computation of matrices of traces and radicals of ideals
- Solving systems of algebraic equations by using Gröbner bases
- On radical zero-dimensional ideals
- Real root finding for low rank linear matrices
- Degröbnerization: a political manifesto
- Computing Gröbner bases by FGLM techniques in a non-commutative setting
- Solving algebraic equations via Buchberger's algorithm
- Homotopy techniques for solving sparse column support determinantal polynomial systems
- An algorithm for solving parametric linear systems
- A note on upper bounds for ideal-theoretic problems
- Title not available (Why is that?)
- Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs
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 Q3033872)
