Searching for "An Algorithm for Exact Division." – sorted by Relevance.
-
Algorithms With Exact Divisions Made Faster
- Algorithms With Exact Divisions Made Faster Arnold Schonhage Institut fur Informatik II der
- Add To MetaCart
-
Integer and Rational Arithmetic on MasPar
- as recent algorithms for exact division and GCD computation. All algorithms work in "least
- Cited by 2 (1 self) – Add To MetaCart
-
Bidirectional Exact Integer Division
- area in Figure 1 -- left-hand side. Jebelean (1993a) proposed an algorithm for exact division which
- Cited by 5 (2 self) – Add To MetaCart
-
On Short Multiplications and Divisions
- , we get an algorithm for exact division whose cost ED(N) is: ED(N) = 2 SD(N=2) = 2 1\Gammaff D ff FM
- Cited by 7 (0 self) – Add To MetaCart
-
-01 Hoon HONG Inter-reduction of Two Polynomials is Unique
- of the PACLIB Kernel Abstract: /abstr92/a33 92-35 Tudor JEBELEAN An Algorithm for Exact Division Abstract
- Add To MetaCart
-
Complexity Bounds for Zero-Test Algorithms
- for exact division in T , then this is also the time complexity of the algorithm in terms of operations in R
- Cited by 1 (1 self) – Add To MetaCart

