As shown in Theorem 3.4, Algorithm
1 has a nice complexity
with respect to the parameters d, h and logN: it is polynomial
with small exponents. However, the complexity with respect to p is
not that good, as it is exponential in logp, which is the
re…