[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

[ACM Press seventh annual ACM symposium

✍ Miller, Gary L. 📂 Article 📅 1975 🏛 ACM Press ⚖ 410 KB

[ACM Press seventh annual ACM symposium

[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 - Comparative complexity of grammar forms

✍ Ginsburg, Seymour; Lynch, Nancy 📂 Article 📅 1975 🏛 ACM Press ⚖ 587 KB

[ACM Press seventh annual ACM symposium

[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 - Two applications of a probabilistic search technique

✍ Fredman, Michael L. 📂 Article 📅 1975 🏛 ACM Press ⚖ 270 KB

[ACM Press the fourteenth annual ACM sym

[ACM Press the fourteenth annual ACM symposium - San Francisco, California, United States (1982.05.05-1982.05.07)] Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82 - Fast algorithms under the extended riemann hypothesis

✍ Bach, Eric 📂 Article 📅 1982 🏛 ACM Press ⚖ 409 KB

[ACM Press the thirty-seventh annual ACM

[ACM Press the thirty-seventh annual ACM symposium - Baltimore, MD, USA (2005.05.22-2005.05.24)] Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC '05 - Convex programming for scheduling unrelated parallel machines

✍ Azar, Yossi; Epstein, Amir 📂 Article 📅 2005 🏛 ACM Press 🌐 English ⚖ 150 KB

[ACM Press the thirty-seventh annual ACM

[ACM Press the thirty-seventh annual ACM symposium - Baltimore, MD, USA (2005.05.22-2005.05.24)] Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC '05 - Convex programming for scheduling unrelated parallel machines

✍ 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