Therefore, if the number of inequalities in the description is n i then the complexity is O(n d n i ).
the complexity of GRE in the gradable case is determined by three steps: The first is quadratic and can be performed off-line, the second has a worst-case running time of O(n v n a ), and the third one has a worst-case running time of O(n d n i ).