Paradigms for Fast Parallel Approximability
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Parallel algorithms in computer science (68W10)
Cited in
(2)
This page was built for publication: Paradigms for Fast Parallel Approximability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3184627)