Computational complexity (nonfiction)

A representation of the relation among complexity classes, which are subsets of each other..

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.

Fiction cross-reference

• 

  The Boxes, while not measurable, are assumed to have extremely high computations complexity.

• Gnomon algorithm
• Mathematics

Nonfiction cross-reference

• Computation (nonfiction)

External links

• Computational complexity @ wiki.karljones.com
• Computational complexity @ Wikipedia