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

[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 - Tensor decomposition and approximation schemes for constraint satisfaction problems

โœ Scribed by de la Vega, W. Fernandez; Karpinski, Marek; Kannan, Ravi; Vempala, Santosh

Book ID
127263539
Publisher
ACM Press
Year
2005
Tongue
English
Weight
170 KB
Category
Article
ISBN-13
9781581139600

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

[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

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