scientific article
From MaRDI portal
Publication:3360296
zbMath0733.13015MaRDI QIDQ3360296
Publication date: 1991
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items
Gröbner bases and cocyclic Hadamard matrices, Computing zero-dimensional tropical varieties via projections, On the complexity exponent of polynomial system solving, Straight-line programs in geometric elimination theory, A factorization algorithm for \(G\)-algebras and its applications, On product decomposition, Root isolation of zero-dimensional polynomial systems with linear univariate representation, Condition number based complexity estimate for solving polynomial systems, Matrix-F5 algorithms over finite-precision complete discrete valuation fields, On the computation of matrices of traces and radicals of ideals, Determinantal formulae for the solution set of zero-dimensional ideals, A note on upper bounds for ideal-theoretic problems, A Gröbner free alternative for polynomial system solving, Finding roots of a multivariate polynomial in a linear subspace, Semidefinite characterization and computation of zero-dimensional real radical ideals, Radical computations of zero-dimensional ideals and real root counting., The degree of a tropical basis, On the complexity of the \(F_5\) Gröbner basis algorithm, Construction of roadmaps in semi-algebraic sets
