关于正交向量(orthogonal vectors)的算法# Programming - 葵花宝典
s*o
1 楼
如果有N个相同维数的向量，how to efficiently find those subsets whose members
are all orthogonal to each other?
E.g. if we have vectors X_1, X_2, ..., X_n
we may find in (X_1, X_5, X_7) all vectors are orthogonal, and we need all
other subsets.
Any references?
Thank you in advance!
are all orthogonal to each other?
E.g. if we have vectors X_1, X_2, ..., X_n
we may find in (X_1, X_5, X_7) all vectors are orthogonal, and we need all
other subsets.
Any references?
Thank you in advance!