𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An O(log N) algorithm to solve linear recurrences on hypercubes

✍ Scribed by H.N. Reddy; E.L. Leiss

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
520 KB
Volume
49
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An algorithm to solve the m Γ— n assignme
An algorithm to solve the m Γ— n assignment problem in expected time O(mn log n)
✍ Richard M. Karp πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 428 KB

## Abstract We give an algorithm to solve the __m__‐source, __n__‐destination assignment problem in expected time __O(mn__ log __n__) under the assumption that the edge costs are independent random variables and the costs of the edges incident with any given source are identically distributed. The