Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

DOI10.1007/b11961zbMath1247.94058OpenAlexW4298253479MaRDI QIDQ5900933

Simon N. Litsyn, Noga Alon, Michael Krivelevich, Tali Kaufman, Dana Ron

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

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Randomized algorithms (68W20)

Related Items

Exploring crypto dark matter: new simple PRF candidates and their applications, Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm, Large values of the Gowers-Host-Kra seminorms, Improving Key Recovery to 784 and 799 Rounds of Trivium Using Optimized Cube Attacks, On Active and Passive Testing, Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes, The inverse conjecture for the Gowers norm over finite fields in low characteristic, An inverse theorem for the Gowers \(U^{s+1}[N\)-norm], Distribution-free connectivity testing for sparse graphs, Breaking the ε-Soundness Bound of the Linearity Test over GF(2), Polynomial functions as splines, Short Locally Testable Codes and Proofs: A Survey in Two Parts, Symmetric LDPC Codes and Local Testing, Finite field models in arithmetic combinatorics -- ten years on, On the complexity of constructing pseudorandom functions (especially when they don't exist), On uniformity of q‐multiplicative sequences, A Canonical Form for Testing Boolean Function Properties, Short Locally Testable Codes and Proofs, Characterizations of locally testable linear- and affine-invariant families, Local correction with constant error rate, Lower bounds for testing triangle-freeness in Boolean functions