Numerical constraint systems are often handled by branch and prune algorithms that combine splitting techniques, local consistencies, and interval methods. This paper first recalls the principles of ...

In this paper, we have proved that the lower bound of the number of real multiplications for computing a length 2t real GFT(a,b) (a = ±1/2, b = 0 or b = ±1/2, a = 0) is 2t+1 – 2t - 2 and that for ...