Difference between revisions of "Computational complexity"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) |
Karl Jones (Talk | contribs) |
||
| Line 1: | Line 1: | ||
'''Computational complexity''' is a branch of [[theoretical computer science]] which attempts to explain why certain [[Computational problem|computational problems]] are intractable for [[Computer|computers]]. | '''Computational complexity''' is a branch of [[theoretical computer science]] which attempts to explain why certain [[Computational problem|computational problems]] are intractable for [[Computer|computers]]. | ||
| + | |||
| + | == Analysis of algorithms == | ||
[[Analysis of algorithms]] is a complementary branch which studies methods of solving computational problems efficiently. | [[Analysis of algorithms]] is a complementary branch which studies methods of solving computational problems efficiently. | ||
Revision as of 17:22, 2 September 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
Analysis of algorithms is a complementary branch which studies methods of solving computational problems efficiently.
