Computing dominances in \(E^ n\) (Q1178238)
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: Computing dominances in \(E^ n\) |
scientific article; zbMATH DE number 23347
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing dominances in \(E^ n\) |
scientific article; zbMATH DE number 23347 |
Statements
Computing dominances in \(E^ n\) (English)
0 references
26 June 1992
0 references
We show the following: Given an \(n\)-point set \(X\subseteq E^ n\), the dominance relation on \(X\) can be computed in time \(O(n^{3/2}M(n)^{3/2})\), where \(M(n)\) denotes the time needed to multiply two \(n\times n\) matrices over \(Z_{n+1}\).
0 references
computation of one or all maximal points for an \(n\)-point subset
0 references
