made with Mathematica technology MathWorld
Algebra
Applied Mathematics
Calculus and Analysis
Discrete Mathematics
Foundations of Mathematics
Geometry
History and Terminology
Number Theory
Probability and Statistics
Recreational Mathematics
Topology
Alphabetical Index
Interactive Entries
Random Entry
New in MathWorld
MathWorld Classroom
About MathWorld
Contribute to MathWorld
Send a Message to the Team
MathWorld Book
12,905 entries
Last updated: Mon Jan 5 2009

Created, developed, and nurtured by Eric Weisstein
at Wolfram Research
Discrete Mathematics > Computer Science > Algorithms > Complexity of Algorithms >
Interactive Entries > Interactive Demonstrations >

Complexity

The complexity of a process or algorithm is a measure of how difficult it is to perform. The study of the complexity of algorithms is known as complexity theory.

SEE ALSO: Complexity Theory, Integer Complexity




CITE THIS AS:

Weisstein, Eric W. "Complexity." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/Complexity.html

SendContact the MathWorld Team
© 1999-2009 Wolfram Research, Inc. | Terms of Use

Complexity in the 
New! Interactive mathematics--The Wolfram Demonstrations Project
Variations on State Transition Diagrams of Elementary Cellular AutomataVariations on State Transition Diagrams of Elementary Cellular AutomataVariations on State Transition Diagrams of Elementary Cellular Automata
JUST RELEASED: Wolfram Mathematica 7