How to reduce the average complexity of convex hull finding algorithms (Q1151049): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:19, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How to reduce the average complexity of convex hull finding algorithms |
scientific article |
Statements
How to reduce the average complexity of convex hull finding algorithms (English)
0 references
1981
0 references
