Factorization of polynomials over a finite field and the solution of systems of algebraic equations

DOI10.1007/BF01095638zbMath0596.12023MaRDI QIDQ1078248

Dima Yu. Grigoriev

Publication date: 1986

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

zbMATH Keywords

algorithmfactorization of polynomialsvarietypolynomial complexityirreducible components

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polynomials in real and complex fields: factorization (12D05) Polynomials in general fields (irreducibility, etc.) (12E05) Equations in general fields (12E12) Polynomials over finite fields (11T06) Varieties and morphisms (14A10) Arithmetic problems in algebraic geometry; Diophantine geometry (14G99)

Related Items

Univariate polynomial factorization over finite fields, On factoring parametric multivariate polynomials, Computational complexity of sentences over fields, Bounds on the number of connected components for tropical prevarieties, Complexity of solving parametric polynomial systems, Theory of computational complexity. Part 9. Transl. from the Russian., Complexity of deciding whether a tropical linear prevariety is a tropical variety, On computing absolutely irreducible components of algebraic varieties with parameters, Efficiently and effectively recognizing toricity of steady state varieties, Matrices in elimination theory, Generalized resultants over unirational algebraic varieties, Sentences over integral domains and their computational complexities

Cites Work

• Résolution des systèmes d'équations algébriques
• Constructions in a Polynomial Ring Over the Ring of Integers
• Algèbre linéaire sur $K[X_1,\dots,X_n$ et élimination]
• The Exact Solution of Systems of Linear Equations with Polynomial Coefficients
• Subresultants and Reduced Polynomial Remainder Sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item