scientific article; zbMATH DE number 3893305
From MaRDI portal
Publication:5184991
zbMath0561.12011MaRDI QIDQ5184991
Publication date: 1984
Full work available at URL: https://eudml.org/doc/67615
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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, Factorization of ℤ$$ \mathbb {Z}$$-Homogeneous Polynomials in the First q-Weyl Algebra, Solving systems of polynomial inequalities in subexponential time, Deformation techniques to solve generalised Pham systems, On a generalization of Stickelberger's theorem, Complexity of solution of linear systems in rings of differential operators, Complexity of testing irreducibility of a system of linear ordinary differential equations, Finding connected components of a semialgebraic set in subexponential time, Complexity of deciding Tarski algebra, On the complexity of counting components of algebraic varieties, Complexity of computing the local dimension of a semialgebraic set, Probabilistic absolute irreducibility test for polynomials
