Assertion: algorithm's input | /r/HasProperty | ergün
Facets:
Source sentences:
text: To verify the correctness of an FFT implementation, rigorous guarantees can be obtained in O(N log N) time by a simple procedure checking the linearity, impulse-response, and time-shift properties of the transform on random inputs (Ergün, 1995).