Difference between revisions of "Computational complexity"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (→See also) |
Karl Jones (Talk | contribs) |
||
| Line 11: | Line 11: | ||
* [[Computational problem]] | * [[Computational problem]] | ||
* [[Theoretical computer science]] | * [[Theoretical computer science]] | ||
| + | |||
| + | [[Category:Complexity]] | ||
| + | [[Category:Computation]] | ||
| + | [[Category:Computer science]] | ||
| + | [[Category:Mathematics]] | ||
Latest revision as of 14:20, 22 April 2016
Computational complexity is a branch of theoretical computer science which attempts to explain why certain computational problems are intractable for computers.
Analysis of algorithms
Analysis of algorithms is a complementary branch which studies methods of solving computational problems efficiently.
