[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 - Fast quantum byzantine agreement

[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 - Undirected ST-connectivity in log-space

✍ Reingold, Omer 📂 Article 📅 2005 🏛 ACM Press 🌐 English ⚖ 203 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 - Undirected ST-connectivity in log-space

✍ Reingold, Omer 📂 Article 📅 2005 🏛 ACM Press 🌐 English ⚖ 203 KB

We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log 4/3 obtained by Armoni, Ta-Shma, Wigderson and Zhou [9]. As undirected st-connectivity is complete for the class of probl

[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

[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 - On lattices, learning with errors, random linear codes, and cryptography

✍ Regev, Oded 📂 Article 📅 2005 🏛 ACM Press 🌐 English ⚖ 506 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 - Approximation algorithms for combinatorial auctions with complement-free bidders

✍ Dobzinski, Shahar; Nisan, Noam; Schapira, Michael 📂 Article 📅 2005 🏛 ACM Press 🌐 English ⚖ 344 KB