Worst-case time complexities.

To save space, the O(.) symbols around each formula were omitted. Note that n = q(m − k+1). The time complexities for PgSA are given for the fixed-k mode with SA sparsity set to 1. In the variable-k mode or when SA sparsity larger than 1 is used, the number of visited SAPG locations should be added to the PgSA complexities.