Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
From MaRDI portal
Publication:1078247
DOI10.1007/BF01095643zbMath0596.12022MaRDI QIDQ1078247
Publication date: 1986
Published in: Journal of Soviet Mathematics (Search for Journal in Brave)
algorithmfactorization of polynomialsvarietypolynomial complexityhomogeneous polynomialsirreducible components
Symbolic computation and algebraic computation (68W30) Polynomials over finite fields (11T06) Varieties and morphisms (14A10) Factorization (11Y05)
Related Items
Porous invariants, Algorithms for near solutions to polynomial equations, Factorization of ℤ$$ \mathbb {Z}$$-Homogeneous Polynomials in the First q-Weyl Algebra, Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. I, The isomorphism problem of projective schemes and related algorithmic problems, Extension of the Newton–Puiseux algorithm to the case of a nonzero characteristic ground field. I, Computation of étale cohomology on curves in single exponential time, On factoring parametric multivariate polynomials, Algorithms for sentences over integral domains, Complexity of computations in Commutative Division of the USSR Academy of Sciences, Computational complexity of sentences over fields, The complexity of local dimensions for constructible sets, 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., A Modified Van der Waerden Algorithm to Decompose Algebraic Varieties and Zero-Dimensional Radical Ideals, Complexity of deciding whether a tropical linear prevariety is a tropical variety, Decidable fragments of field theories, On computing absolutely irreducible components of algebraic varieties with parameters, Efficiently and effectively recognizing toricity of steady state varieties, Matrices in elimination theory, A deterministic polynomial-time algorithm for the first Bertini theorem. III, Systems with parameters, or efficiently solving systems of polynomial equations 33 years later. II, Generalized resultants over unirational algebraic varieties, Polynomial-time computation of the degree of a dominant morphism in zero characteristic. IV., Sentences over integral domains and their computational complexities, Approximate solutions of polynomial equations.
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
