Let L be an algebraic function field in k ≥ 0 parameters t1, . . . , tk. Let f1, f2 be non-zero polynomials in L[x]. We give two algorithms for computing their gcd. The first,...
— Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values...
A three-dimensional analogue of the classical direction problem is proposed and an asymptotically sharp bound for the number of directions determined by a nonplanar set in AG(3, p)...
Abstract. This paper describes a complete implementation of Ritt-Wu's characteristic sets method in the Maple system. The implemented algorithms include those with variants fo...
We use higher-order logic to verify a quantifier elimination procedure for linear arithmetic over ordered fields, where the coefficients of variables are multivariate polynomials o...