The special
structure of this problem allows us to make exact estimates of
the complexity. For the old approach, we show that the
complexity of the intersection problem is \(O(n^{3})\) , the same
as the complexity of the numerical computations
[1]}, [2]}. For the
new approach, the complexity of the second part is reduced to
\(O(n^{2} (\log n)^{2})\) .
