- Full text PDF available (0)
- This year (0)
- Last 5 years (0)
- Last 10 years (0)
Journals and Conferences
Exploiting the structure of the 2-dimensional sorting problem associated with the polynomial product has been the strategy in the design of certain algorithms which are faster for a large class of problems than those found in the literature. First a parallel is drawn between GEN-MULT and Horowitz’s SORTMULT algorithm [A sorting algorithm ]’or polynomial… (More)
A listprocessing system which allows assignment of cells of any length, expressed in a discrete number of computer words, is proposed for a wider range of problems than just for the algebraic manipulation systems for which it was designed. Erasure of lists is done while preserving contiguity of space by means of an internal and external linkage technique. A… (More)
Two algorithms will be discussed:GEN-MULT for the sorting of general tableaux and dense to moderately unstructured (multivariate) polynomials. This algorithm is based on the general properties of a "tableau", which hold for the matrix of the exponents of the polynomial product.
A new algorithm for integer Greatest Common Divisor calculations has recently been proposed. Although the algorithm can be applied to integers in any base b > 2, it is conjectured to be optimal for b=30, when embedded in a system for symbol manipulation. Representation of the digits in factored form further facilitates the GCD procedure. When choosing… (More)
In recent years a system for the handling of large multivariate polynomials has been developed at the University of Alabama in Birmingham. The coding is generally done in Fortran IV; some special features are coded in PL/1, for the IBM systems 360 or 370. No machine coding is involved.