is not explicitly non-deterministic only calls deterministic methods then the method is deterministic. With the scan of a single method complete, control returns to the class visitor.

In computational complexity theory, P and NP are two classes of problems. P is the class of decision problems that a deterministic Turing machine can solve in polynomial time. In useful terms… ...

BARTOSZ ŹRALEK, A DETERMINISTIC VERSION OF POLLARD'S p – 1 ALGORITHM, Mathematics of Computation, Vol. 79, No. 269 (JANUARY 2010), pp. 513-533 ...