No label defined (Q3716334)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3945382
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3945382 |
Statements
1985
0 references
computational geometry
0 references
0.8393336534500122
0 references
0.8349164724349976
0 references
0.832310140132904
0 references
[For the entire collection see Zbl 0575.00022.] Parallel algorithms are described for three problems that are often to be solved in computational geometry, namely selection, sorting and computing convex hulls. For a problem of size n, all three algorithms use \(n^{1- e}\) processors where \(0<e<1\) and depends on the number of available processors. The cost of each of the algorithms, i.e. the number of processors multiplied by the worst-case running time, matches an existing lower bound on the number of operations required in the worst case to solve the given problem and is therefore optimal to within a constant factor.
0 references