scientific article; zbMATH DE number 1302473
From MaRDI portal
Publication:4247789
zbMath0932.13019MaRDI QIDQ4247789
Gerhard Pfister, Gert-Martin Greuel, Wolfram Decker
Publication date: 2 September 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Ideals and multiplicative ideal theory in commutative rings (13A15)
Related Items
Unnamed Item, Symbolic Rees Algebras, Noether normalization guided by monomial cone decompositions, Comparison of probabilistic algorithms for analyzing the components of an affine algebraic variety, Implementation of prime decomposition of polynomial ideals over small finite fields, Extended \(F_5\) criteria, Differential Elimination for Dynamical Models via Projections with Applications to Structural Identifiability, A Direttissimo Algorithm for Equidimensional Decomposition, Conormal spaces and Whitney stratifications, A signature-based algorithm for computing the nondegenerate locus of a polynomial system, Cohomology, stratifications and parametric Gröbner bases in characteristic zero., Segre-driven radicality testing, Parallelization of modular algorithms, Computing syzygies by Faugère's \(\mathbb{F}_{5}\) algorithm, Primary Decompositions, An algorithm for primary decomposition in polynomial rings over the integers, Efficient computation of Castelnuovo-Mumford regularity, Algebraic geometry of Bayesian networks, Computing restrictions of ideals in finitely generated \(k\)-algebras by means of Buchberger's algorithm, Random arithmetic formulas can be reconstructed efficiently, Numerical algorithms for detecting embedded components, Usage of modular techniques for efficient computation of ideal operations, Numerical computation of H-bases, Normal projection: deterministic and probabilistic algorithms, Asymptotically fast group operations on Jacobians of general curves, Efficient Algorithms for Computing Nœther Normalization, Primary decomposition of zero-dimensional ideals over finite fields, Computing minimal associated primes in polynomial rings over the integers, Algorithms for computing a primary ideal decomposition without producing intermediate redundant components, Subexponential-time computation of isolated primary components of a polynomial ideal, Computing H-bases via minimal bases for syzygy modules, Primary ideals and their differential equations, On singularities of real algebraic sets and applications to kinematics, Primary Decomposition in Singular, Noetherian operators and primary decomposition, Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one, Evaluation techniques for zero-dimensional primary decomposition, Applications of some properties of the canonical module in computational projective algebraic geometry, Computer algebra and algebraic geometry -- achievements and perspectives, Effective algorithm for computing Noetherian operators of zero-dimensional ideals, Numerical homotopies to compute generic points on positive dimensional algebraic sets, Efficient localization at a prime ideal without producing unnecessary primary components, Computing the primary decomposition of zero-dimensional ideals
Uses Software
