About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
SYMSAC 1976
Conference paper
Algebraic algorithms using p-adic constructions
Abstract
Machine computation of many algebraic operations of interest and utility to mathematicians and scientists has received increasing attention in the recent years. A variety of terminology has been used to describe this area of mathematical computation. Among these are symbolic manipulation, computer algebra, algebraic methods, constructive algebra, and seminumerical algorithms. Whatever name is chosen for the field currently known as symbolic and algebraic manipulation, the most fundamental part of any symbolic computer software system for the actual computing is always the workhorse subpackage that deals with polynomial and rational functions.