Hi all, Assuming we let m = |M| and n = # of directed trees whose GCP we are interested in, would an algorithm that is bounded by O(n^2 * m) be considered polynomial? I don't think it's exponential, since neither n nor m appear as an exponent, but I'm not sure if it's still polynomial. Thanks in advance! -- Andrei Mackenzie