scientific article
From MaRDI portal
Publication:3992572
zbMath0679.12001MaRDI QIDQ3992572
Publication date: 17 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials in real and complex fields: factorization (12D05) Polynomials over finite fields (11T06) Polynomials and rational functions of one complex variable (30C10) Mathematics in general (00A05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to field theory (12-01)
Related Items
Lower bounds for diophantine approximations, Elimination of constants from machines over algebraically closed fields, On efficient sparse integer matrix Smith normal form computations, ON SETS SUCH THAT THE PARTITION FUNCTION IS EVEN FROM A CERTAIN POINT ON, On the elements of sets with even partition function, Coupled systems of non-smooth differential equations, The reduced Bautin index of planar vector fields, Determinantal formulae for the solution set of zero-dimensional ideals, Pythagoras numbers of real irreducible algebroid curves and Gram matrices, Kronecker's and Newton's approaches to solving: a first comparison, Theory of computational complexity. Part 9. Transl. from the Russian., An algorithm for computing certified approximate GCD of \(n\) univariate polynomials, Une borne optimale pour la programmation entière quasi-convexe
