scientific article; zbMATH DE number 3959582
From MaRDI portal
Publication:3728104
algebraic varietyalgorithmcomplexityfactorization of polynomialsirredicuble componentspolynomial time
Polynomials over finite fields (11T06) Polynomials in real and complex fields: factorization (12D05) Polynomials in general fields (irreducibility, etc.) (12E05) Equations in general fields (12E12) Varieties and morphisms (14A10) Arithmetic problems in algebraic geometry; Diophantine geometry (14G99) Analysis of algorithms and problem complexity (68Q25)
Recommendations
Cited in
(13)- 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
- An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs
- Feasibility testing for systems of real quadratic equations
- Fast Hybrid Solution of Algebraic Systems
- scientific article; zbMATH DE number 1057749 (Why is no real title available?)
- Fast Decomposition of Polynomials with Known Galois Group
- scientific article; zbMATH DE number 3893304 (Why is no real title available?)
- Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields
- Complexity of factoring and calculating the GCD of linear ordinary differential operators
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3728104)
