Titlebook: Design and Implementation of Symbolic Computation Systems; International Sympos Alfonso Miola Conference proceedings 1993 Springer-Verlag B

补充

陈腐思想

难管

Erythropoietin

Improving the multiprecision Euclidean algorithm,le digits, enhanced condition for exiting the partial cosequence computation, and approximative GCD computation. The combined effect of these improvements is an experimentally measured speed-up by a factor of 2 over the currently used implementation.

的阐明

Storage allocation for the Karatsuba integer multiplication algorithm,t). We give sharp upper and lower bounds for the amount of auxiliary storage required and discuss implementation issues. Since we must never allocate too few memory cells, an asymptotic formula is not sufficient. The bounds are 2(.−4 + 3⌈log.(.−3)⌋) and 2(.−6 + 2⌈log.(.−2)⌋), respectively. The formu

过份好问

hardheaded

Gauss: a parameterized domain of computation system with support for signature functions,ntegers modulo ., by substituting random numbers for variables, and mapping constants modulo .. This idea is exploited in specific algorithms in computer algebra systems, e.g. algorithms for polynomial greatest common divisors. It is also used as a heuristic to speed up other calculations. But none

愚蠢人

玷污

Subtyping inheritance in languages for symbolic computation systems,s problems still exist in object-oriented languages, due to the interaction between polymorphism and method redefinition. Here a mechanism of subtyping inheritance is presented, in order to propose a solution of these problems. A subtyping inheritance mechanism (.) is defined by deriving from the ch

漫不经心