๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Minimal multiplicative covers of an integer

โœ Scribed by Carl G. Wagner

Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
633 KB
Volume
24
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

VfE[!. kj. 1 Ji+, Si#S)l have been studied Dreviously by Hcarnz and Wagner. The prrsent paper *-eats three arrays. rG(n. k). 61(n. k). and k(n. k). which extend min. k i in the sense .:hat I ., PI --l R*k)=~(p,...p,.k)=ri(p,.. -p,. k)= ni(s.k) for all sequences (r,. . . . _p,l of distinct primes.

๐Ÿ“œ SIMILAR VOLUMES

Minimal Covers of the Klein Quadric
Minimal Covers of the Klein Quadric
โœ J. Eisfeld; L. Storme; P. Sziklai ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 129 KB

A t-cover of a quadric Q is a set C of t-dimensional subspaces contained in Q such that every point of Q belongs to at least one element of C. We consider t-covers of the Klein quadric Q + (5, q). For t=2, we show that a 2-cover has at least q 2 +q elements, and we give an exact description of the e

An efficient algorithm for parallel inte
An efficient algorithm for parallel integer multiplication
โœ Benjamin Singer; George Saon ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 67 KB

In this paper we propose an efficient algorithm to implement parallel integer multiplication by a combination of parallel additions, shifts and reads from a memoryresident lookup table dedicated to squares. Such an operator called PIM (parallel integer multiplication) is in fact microprogrammed at t

An algorithm for concave integer minimiz
An algorithm for concave integer minimization over a polyhedron
โœ Harold P. Benson; S. Selcuk Erenguc ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 753 KB

We present an algorithm for solving the problem of globally minimizing a concave function over the integers contained in a compact polyhedron. The objective function of this problem need not be separable or even analytically defined. To our knowledge, the algorithm is the first ever proposed for thi