Research exposition (monographs, survey articles) pertaining to computer science (68-02) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Computational learning theory (68Q32) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)
Recommendations
Cites work
- Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
- Distance Approximation in Bounded-Degree and General Sparse Graphs
- scientific article; zbMATH DE number 5485551 (Why is no real title available?)
- Testing Reed–Muller Codes
- Tolerant property testing and distance approximation
This page was built for publication: The program of the mini-workshop
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4933360)