The complexity can be represented by the overall operation to be performed to implement cyclosationary detection (FFT size and matrix multiplication windowing....).
To find the computational complexity, the number of additions, multiplications, matrix inversions and so on should be found. For cyclostationary algorithm, if you do it in frequency domain the FFT size and required operations for this process is evaluated before. For FFT please refer to Digital Signal Processing by Proakis.