I have a set of n-dimensional vectors, lets say, v1, v2, v3, ... vm
means the dot product of vi and vj.
It is known that >= 0 forall i, j i.e. the angle between any
two of them is less equal to 90 degrees, which basically means that all of
them can be occupied in a single quadrant in the n
I becoming crazy with this problem.
In a nutshell,
- I have 8 Millions pieces
- I need only 10 to 48 pieces to solve this puzzle
- Each piece are unique, and can be used only once
- 48 pieces is max
- 10 is a minimum but it can be rarely lower
How can I solve this ?
The problem is bigger than t
