Difference between revisions of "Computational complexity"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (First) |
Karl Jones (Talk | contribs) (→See also) |
||
| Line 6: | Line 6: | ||
* [[Computation]] | * [[Computation]] | ||
| − | * [[Computational | + | * [[Computational problem]] |
* [[Theoretical computer science]] | * [[Theoretical computer science]] | ||
Revision as of 04:56, 21 August 2015
Computational complexity is a branch of theoretical computer science which attempts to explain why certain computational problems are intractable for computers.
Analysis of algorithms is a complementary branch which studies methods of solving computational problems efficiently.
