Parallel comparison algorithms for approximation problems (Q808727)
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: Parallel comparison algorithms for approximation problems |
scientific article; zbMATH DE number 4211537
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel comparison algorithms for approximation problems |
scientific article; zbMATH DE number 4211537 |
Statements
Parallel comparison algorithms for approximation problems (English)
0 references
1991
0 references
approximation problems
0 references
parallel comparison tree
0 references
approximate maximum problem
0 references
approximate sorting
0 references
approximate merging
0 references
0.8135509490966797
0 references
0.8122059106826782
0 references
0.8087175488471985
0 references
0.8070584535598755
0 references
