𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Techniques from combinatorial approximation algorithms yield efficient algorithms for random -SAT

✍ Scribed by Amin Coja-Oghlan; Andreas Goerdt; André Lanka; Frank Schädlich

Book ID
108280980
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
511 KB
Volume
329
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Appr
[Lecture Notes in Computer Science] Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques Volume 4110 || Local Decoding and Testing for Homomorphisms
✍ Díaz, Josep; Jansen, Klaus; Rolim, José D. P.; Zwick, Uri 📂 Article 📅 2006 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 494 KB

This is the joint refereed proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and the 10th International Workshop on Randomization and Computation, RANDOM 2006. The book presents 44 carefully reviewed and revised full papers

[Lecture Notes in Computer Science] Appr
[Lecture Notes in Computer Science] Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques Volume 4110 || Adaptive Sampling and Fast Low-Rank Matrix Approximation
✍ Díaz, Josep; Jansen, Klaus; Rolim, José D. P.; Zwick, Uri 📂 Article 📅 2006 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 432 KB

This is the joint refereed proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and the 10th International Workshop on Randomization and Computation, RANDOM 2006. The book presents 44 carefully reviewed and revised full papers

[Lecture Notes in Computer Science] Appr
[Lecture Notes in Computer Science] Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques Volume 4110 || On Bounded Distance Decoding for General Lattices
✍ Díaz, Josep; Jansen, Klaus; Rolim, José D. P.; Zwick, Uri 📂 Article 📅 2006 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 534 KB

This is the joint refereed proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and the 10th International Workshop on Randomization and Computation, RANDOM 2006. The book presents 44 carefully reviewed and revised full papers

An efficient retrieval selection algorit
An efficient retrieval selection algorithm for video servers with random duplicated assignment storage technique
✍ Chor Ping Low 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 122 KB

Random Duplicated Assignment (RDA) is an approach in which video data is stored by assigning a number of copies of each data block to different, randomly chosen disks. It has been shown that this approach results in smaller response times and lower disk and RAM costs compared to the well-known disk