Connexions

Sections
You are here: Home » Content » DFT: Computational Complexity

About: DFT: Computational Complexity

Module by: Don Johnson

View content

Metadata

Name: DFT: Computational Complexity
ID: m0503
Language: English (en)
Summary: A brief explanation of calculation complexity and how the complexity of the discrete Fourier transform is order N squared.
Subject: Mathematics and Statistics, Science and Technology
Keywords: computational complexity, discrete fourier transform
Document Type: -//CNX//DTD CNXML 0.5 plus MathML//EN
License: Creative Commons Attribution License (CC-BY 1.0)
Authors: Don Johnson (dhj@rice.edu)
Copyright Holders: Don Johnson (dhj@rice.edu)
Maintainers: CJ Ganier (seejaie@rice.edu), Don Johnson (dhj@rice.edu), John Cottrell (jac3@rice.edu)
Version: 2.11 (history)
Created: Jul 18, 2000 12:00 am GMT-5
Revised: Apr 13, 2005 9:22 am GMT-5

Version History

Version: 2.11 Apr 13, 2005 9:22 am GMT-5 by Charlet Reedstrom
Changes: 
update to cnxml-0.5, update mathml
Version: 2.10 Jul 27, 2003 3:59 pm GMT-5 by Don Johnson
Changes: 
Fixed intermodule link errors.
Version: 2.9 Nov 20, 2002 12:00 am US/Central by (Unknown)
Changes: 
Fixed typos.
Version: 2.8 Aug 13, 2002 12:00 am GMT-5 by (Unknown)
Changes: 
Upgraded to 0.4.
Version: 2.7 Aug 3, 2002 12:00 am GMT-5 by (Unknown)
Changes: 
fixed some typos.
Version: 2.6 Apr 19, 2002 12:00 am GMT-5 by (Unknown)
Changes: 
audited for mathml and cnxml errors
Version: 2.5 Sep 11, 2001 12:00 am GMT-5 by Brent Hendricks
Changes: 
Converted to CNXML 0.3.5
Version: 2.4 Aug 22, 2001 12:00 am GMT-5 by (Unknown)
Changes: 
Made O() a function
Version: 2.3 Jul 17, 2001 12:00 am GMT-5 by (Unknown)
Changes: 
added keywords
made John Cottrell a maintainer
fixed minor errors
Version: 2.2 Jun 5, 2001 12:00 am GMT-5 by (Unknown)
Changes: 
Corrected big O notation to be a presentation ML notation rather than a function in Content ML.  Also fixed some capitalization.
Version: 2.1 May 31, 2001 12:00 am GMT-5 by (Unknown)
Changes: 
Replaced some emphasis with term.
Version: 2.0 Oct 17, 2000 12:00 am GMT-5 by Brent Hendricks
Changes: 
Bumped version to 2.0

How to Reuse and Attribute This Content

If you derive a copy of this content using a Connexions account and publish your version, proper attribution of the original work will be automatically done for you.

If you reuse this work elsewhere, in order to comply with the attribution requirements of the license (CC-BY 1.0), you must include

  • the authors' names: Don Johnson
  • the title of the work: DFT: Computational Complexity
  • the Connexions URL where the work can be found: http://cnx.org/content/m0503/2.11/

See the citation section below for examples you can copy.

How to Cite and Attribute This Content

The following citation styles comply with the attribution requirements for the license (CC-BY 1.0) of this work:

American Chemical Society (ACS) Style Guide:

Johnson, D. DFT: Computational Complexity, Connexions Web site. http://cnx.org/content/m0503/2.11/, Apr 13, 2005.

American Medical Assocation (AMA) Manual of Style:

Johnson D. DFT: Computational Complexity [Connexions Web site]. April 13, 2005. Available at: http://cnx.org/content/m0503/2.11/.

American Psychological Assocation (APA) Publication Manual:

Johnson, D. (2005, April 13). DFT: Computational Complexity. Retrieved from the Connexions Web site: http://cnx.org/content/m0503/2.11/

Chicago Manual of Style (Bibliography):

Johnson, Don. "DFT: Computational Complexity." Connexions. April 13, 2005. http://cnx.org/content/m0503/2.11/.

Chicago Manual of Style (Note):

Don Johnson, "DFT: Computational Complexity," Connexions, April 13, 2005, http://cnx.org/content/m0503/2.11/.

Chicago Manual of Style (Reference, in Author-Date style):

Johnson, D. 2005. DFT: Computational Complexity. Connexions, April 13, 2005. http://cnx.org/content/m0503/2.11/.

Modern Languages Association (MLA) Style Manual:

Johnson, Don. DFT: Computational Complexity. Connexions. 13 Apr. 2005 <http://cnx.org/content/m0503/2.11/>.