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

[ACM Press seventh annual ACM symposium - Albuquerque, New Mexico, United States (1975.05.05-1975.05.07)] Proceedings of seventh annual ACM symposium on Theory of computing - STOC '75 - Riemann's Hypothesis and tests for primality

โœ Scribed by Miller, Gary L.


Book ID
111688690
Publisher
ACM Press
Year
1975
Weight
410 KB
Volume
0
Category
Article

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


[ACM Press the thirty-seventh annual ACM
โœ Azar, Yossi; Epstein, Amir ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› ACM Press ๐ŸŒ English โš– 150 KB

We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . The goal is to find a schedule that minimizes the p norm. Previous work showed a 2-approximation algorithm for the proble