Computational complexity
From Wiki @ Karl Jones dot com
Revision as of 05:56, 21 August 2015 by Karl Jones (Talk | contribs)
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.
