Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

DOI10.1007/11538462zbMath1105.68347OpenAlexW2649657569MaRDI QIDQ5479379

Atri Rudra, Venkatesan Guruswami

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

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Other types of codes (94B60) Decoding (94B35)

Related Items (7)

Local Testing of Lattices ⋮ Erasures versus errors in local decoding and property testing ⋮ Approximating the distance to monotonicity of Boolean functions ⋮ Testing low-degree polynomials over prime fields ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Tolerant property testing and distance approximation

This page was built for publication: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques