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