 The previous best known parallel predicate detection algorithm, ParallelCut, had work complexity O(m^3n^3\log mn).
<meaning-changed>  The previous best known parallel predicate detection algorithm, ParallelCut, had work complexity O(m^3n^3\log mn).
 The previous best known parallel predicate detection algorithm, ParallelCut, had, has time complexity O(\log mn) and work complexity O(m^3n^3\log mn).