AKS is not sublinear. It runs in poly(n) time, where n is the number of bits in the input (i.e. input size).

> https://en.wikipedia.org/wiki/AKS_primality_test though it's number theory, and concerned with numbers of size n, rather than lists of length n.

They were talking about not reading a lot of the input, so that's not it.

For that case, a better 'n' to use could be the number of digits in the number.