Computing Dominances in E^n
暂无分享,去创建一个
We show the following: Given an n-point set X⊆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 nxn matrices over Z n+1 .
[1] Rajan Suri. Strengthening the review process , 1990 .
[2] Don Coppersmith,et al. Matrix multiplication via arithmetic progressions , 1987, STOC.