𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Combinatoric Division Algorithm for Fixed-Integer Divisors

✍ Scribed by Jacobsohn, David H.

Book ID
114605805
Publisher
IEEE
Year
1973
Tongue
English
Weight
394 KB
Volume
C-22
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A carry-free algorithm for finding the g
A carry-free algorithm for finding the greatest common divisor of two integers
✍ George B. Purdy πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 503 KB

We investigate a variant of the so-called "binary" algorithm for finding the GCD (greatest common divisor) of two numbers which requires no comparisons. We show that when implemented with carry-save hardware, it can be used to find the modulo B inverse of an n-bit binary integer in a time proportion

An integer programming algorithm for por
An integer programming algorithm for portfolio selection with fixed charges
✍ Mary W. Cooper; Keyvan Farhangian πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 262 KB

## Abstract A mean‐variance portfolio selection model with limited diversification is formulated in which transaction and management costs are incorporated as the sum of a linear cost and a fixed cost. The problem is a fixed charge integer programming problem solved by hypersurface search using dyn