Difference between revisions of "Computational complexity"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (First) |
(No difference)
|
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.
