A Randomized Parallel Algorithm for Efficiently Finding Near-Optimal Universal Hitting Sets (Q5041795)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Randomized Parallel Algorithm for Efficiently Finding Near-Optimal Universal Hitting Sets |
scientific article; zbMATH DE number 7602183
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Randomized Parallel Algorithm for Efficiently Finding Near-Optimal Universal Hitting Sets |
scientific article; zbMATH DE number 7602183 |
Statements
A Randomized Parallel Algorithm for Efficiently Finding Near-Optimal Universal Hitting Sets (English)
0 references
14 October 2022
0 references
universal hitting sets
0 references
parallelization
0 references
randomization
0 references
