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