Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
From MaRDI portal
Publication:5479393
DOI10.1007/11538462zbMath1142.94394OpenAlexW2649657569MaRDI QIDQ5479393
Publication date: 7 July 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11538462
Related Items (8)
Unnamed Item ⋮ Unnamed Item ⋮ Local List Recovery of High-Rate Tensor Codes and Applications ⋮ The tensor product of two good codes is not necessarily robustly testable ⋮ On the rectangle method in proofs of robustness of tensor products ⋮ Tensor Products of Weakly Smooth Codes Are Robust ⋮ Composition of semi-LTCs by two-wise tensor products ⋮ Robust locally testable codes and products of codes
This page was built for publication: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques