✦ LIBER ✦

A Jacobi algorithm and metric theory for greatest common divisors

✍ Scribed by M.S Waterman

Publisher: Elsevier Science
Year: 1977
Tongue: English
Weight: 479 KB
Volume: 59
Category: Article
ISSN: 0022-247X
DOI: 10.1016/0022-247x(77)90109-3

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

Algorithms for producing grammars from s

Algorithms for producing grammars from sample derivations: a common problem of formal language theory and developmental biology

✍ Horacio Feliciangeli; Gabor T. Herman 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 926 KB

We give a number of algorithms which for a finite set of finite sequences of strings of symbols decide whether or not there exists a grammar of a certain fixed type such that each of the sequences is a derivation (or subderivation) by the grammar. Whenever such grammars exist, our algorithms will ef