On the complexity of graph-based bounds for the probability bounding problem