The Program of the Mini-Workshop

DOI10.1007/978-3-642-16367-8_2zbMath1308.68150OpenAlexW82866217MaRDI QIDQ4933360

Oded Goldreich

Publication date: 12 October 2010

Published in: Property Testing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-16367-8_2

Mathematics Subject Classification ID

Computational learning theory (68Q32) Graph theory (including graph drawing) in computer science (68R10) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)

Cites Work

• Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
• Tolerant property testing and distance approximation
• Testing Reed–Muller Codes
• Distance Approximation in Bounded-Degree and General Sparse Graphs
• Unnamed Item

This page was built for publication: The Program of the Mini-Workshop