Deterministic normal position transformation and its applications
type: Item
instance of: scholarly article
title: Deterministic normal position transformation and its applications
zbMATH Open document ID: 1456.13017
author: Benyamin M.-Alizadeh
author: Amir Hashemi
published in: Theoretical Computer Science
publication date: 2020-10-12T00:00:00Z
Mathematics Subject Classification ID: 13P10
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 7259073
zbMATH Keywords: polynomial ideals
zbMATH Keywords: Gröbner bases
zbMATH Keywords: normal position
zbMATH Keywords: deterministic algorithm
zbMATH Keywords: shape lemma
describes a project that uses: Kronecker
describes a project that uses: ISOLATE
describes a project that uses: Bertini
MaRDI profile type: Publication
full work available at URL: j.tcs.2020.07.025
OpenAlex ID: W3044060291
cites work: Q3975184
cites work: Numerically solving polynomial systems with Bertini
cites work: Q4234296
cites work: Q4693774
cites work: Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
cites work: Algorithms for computing triangular decomposition of polynomial systems
cites work: Q3413659
cites work: Using Algebraic Geometry
cites work: Solving polynomial equations. Foundations, algorithms, and applications
cites work: The membership problem for unmixed polynomial ideals is solvable in single exponential time
cites work: Evaluation techniques for zero-dimensional primary decomposition
cites work: A concise proof of the Kronecker polynomial system solver from scratch
cites work: Efficient computation of zero-dimensional Gröbner bases by change of ordering
cites work: Q3033872
cites work: Gröbner bases and primary decomposition of polynomial ideals
cites work: Q3973337
cites work: A Gröbner free alternative for polynomial system solving
cites work: Q3313974
cites work: Deterministic genericity for polynomial ideals
cites work: On the stability of Gröbner bases under specializations
cites work: Q4507801
cites work: Q5317677
cites work: Q3360999
cites work: Factoring polynomials with rational coefficients
cites work: Gröbner bases of ideals defined by functionals with an application to ideals of projective points
cites work: Q4413922
cites work: An FGLM-like algorithm for computing the radical of a zero-dimensional ideal
cites work: Q4850728
cites work: Q5515457
cites work: Solving zero-dimensional systems through the rational univariate representation
cites work: Numerical Polynomial Algebra
cites work: A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
cites work: A zero structure theorem for polynomial-equations-solving and its applications
cites work: Modern computer algebra
DOI: 10.1016/J.TCS.2020.07.025
description: scientific article; zbMATH DE number 7259073