scientific article; zbMATH DE number 3893304
From MaRDI portal
Publication:5184990
zbMath0561.12010MaRDI QIDQ5184990
Publication date: 1984
Full work available at URL: https://eudml.org/doc/67620
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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
Finding irreducible components of some real transcendental varieties, Feasibility testing for systems of real quadratic equations, Factoring multivariate polynomials via partial differential equations, An effective algorithm for deciding the solvability of a system of polynomial equations over 𝑝-adic integers, An effective construction of a small number of equations defining an algebraic variety, Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic, Solving systems of polynomial inequalities in subexponential time, An effective version of the first Bertini theorem in nonzero characteristic and its applications, On a generalization of Stickelberger's theorem, Polynomial-time algorithms for a new model of representation of algebraic varieties (in characteristic zero), Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. III, An overview of effective normalization of a projective algebraic variety nonsingular in codimension one, On algorithm complexity, Complexity of solution of linear systems in rings of differential operators, Complexity of testing irreducibility of a system of linear ordinary differential equations, Algorithm of polynomial complexity for factoring polynomials over local fields, Deciding consistency of systems of exponential-polynomial inequalities in subexponential time, Factorization of solvable polynomials over finite fields and the generalized Riemann hypothesis, Polynomial complexity algorithms for computational problems in the theory of algebraic curves, Searching for Primitive Roots in Finite Fields, An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation, Effective construction of an algebraic variety nonsingular in codimension one over a ground field of zero characteristic, An improvement of the complexity bound for solving systems of polynomial equations, Finding connected components of a semialgebraic set in subexponential time, Complexity of deciding the first-order theory of real closed fields, Subexponential-time computation of isolated primary components of a polynomial ideal, Efficient estimation of roots from the field of fractional power series of a given polynomial in nonzero characteristic, A deterministic polynomial-time algorithm for the first Bertini theorem. I, Complexity of deciding Tarski algebra, On the complexity of counting components of algebraic varieties, Complexity of computing the local dimension of a semialgebraic set, Monodromy and irreducibility criteria with algorithmic applications in characteristic zero, Finding irreducible and primitive polynomials, Solving systems of polynomial inequalities over a real closed field in subexponential time, Probabilistic absolute irreducibility test for polynomials
