Hi, I am interested in knowing the time/space complexity of computing the bounding box of a polyhedra given in constraint form. By looking at the manuals, I found that PPL supports such a computation. However, I am not able to find out its complexity. Any ideas? Thanks in advance for any replies. Ln.