Computational complexity

From Wiki @ Karl Jones dot com
Jump to: navigation, search

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.

See also