scientific article
From MaRDI portal
Publication:3728104
zbMath0596.12021MaRDI QIDQ3728104
Dima Yu. Grigoriev, Alexander L. Chistov
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexityalgorithmfactorization of polynomialspolynomial timealgebraic varietyirredicuble components
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
Feasibility testing for systems of real quadratic equations, Computer algebra: Past and future, Solving systems of polynomial inequalities in subexponential time, The membership problem for unmixed polynomial ideals is solvable in single exponential time, The complexity of deciding consistency of systems of polynomials in exponent inequalities, Complexity of deciding Tarski algebra, Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields, An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs, Complexity of factoring and calculating the GCD of linear ordinary differential operators
