Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
From MaRDI portal
Publication:5900935
DOI10.1007/b11961zbMath1279.94142OpenAlexW4298253479MaRDI QIDQ5900935
Madhu Sudan, Oded Goldreich, Eli Ben-Sasson
Publication date: 26 May 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11961
Related Items (6)
Bounds on 2-query locally testable codes with affine tests ⋮ Towards lower bounds on locally testable codes via density arguments ⋮ Limitation on the Rate of Families of Locally Testable Codes ⋮ Short Locally Testable Codes and Proofs: A Survey in Two Parts ⋮ Dense Locally Testable Codes Cannot Have Constant Rate and Distance ⋮ Short Locally Testable Codes and Proofs
This page was built for publication: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
