scientific article

zbMath0552.68047MaRDI QIDQ3345782

Daniel Lazard

Publication date: 1982

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmfactorization of polynomialslinear equationsprimary decompositionalgebraic extension of fieldsprimality of a polynomial ideal

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Algebraic field extensions (12F05) Polynomials in general fields (irreducibility, etc.) (12E05) Ideals and multiplicative ideal theory in commutative rings (13A15) Relevant commutative algebra (14A05) General commutative ring theory (13Axx)

Related Items (11)

Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time ⋮ Factorization of polynomials over a finite field and the solution of systems of algebraic equations ⋮ New constructive methods in classical ideal theory ⋮ History and basic features of the critical-pair/completion procedure ⋮ Finding the radical of an algebra of linear transformations ⋮ Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. III ⋮ Combinatorial dimension theory of algebraic varieties ⋮ Direct methods for primary decomposition ⋮ Systems with parameters, or efficiently solving systems of polynomial equations 33 years later. II ⋮ Ideal basis and primary decompositions: case of two variables ⋮ Construction of n variable codes

This page was built for publication: