Loading [MathJax]/jax/output/SVG/config.js
Skip to main content
Library homepage
 

Text Color

Text Size

 

Margin Size

 

Font Type

Enable Dyslexic Font
Engineering LibreTexts

Search

  • Filter Results
  • Location
  • Classification
    • Article type
    • Author
    • Set as Cover Page of Book
    • License
    • Show TOC
    • Transcluded
    • OER program or Publisher
    • Autonumber Section Headings
    • License Version
    • Print CSS
  • Include attachments
Searching in
About 1 results
  • https://eng.libretexts.org/Courses/Arkansas_Tech_University/Discrete-Time_Signal_Processing/09%3A_DFT_-_Computational_Complexity
    Thus, a procedure's stated complexity says that the time taken will be proportional to some function of the amount of data used in the computation and the amount demanded. In complexity calculations, ...Thus, a procedure's stated complexity says that the time taken will be proportional to some function of the amount of data used in the computation and the amount demanded. In complexity calculations, we only worry about what happens as the data lengths increase, and take the dominant term—here the 4N 2 term—as reflecting how much work is involved in making the computation.

Support Center

How can we help?