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.

In the News

• 

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

Fiction cross-reference

• Gnomon algorithm
• Gnomon Chronicles
• Mathematics

Nonfiction cross-reference

• Algorithm (nonfiction)
• Complexity (nonfiction)
• Computation (nonfiction)
• Mathematics (nonfiction)
• Polynomial hierarchy (nonfiction) - a hierarchy of complexity classes that generalize the classes P, NP and co-NP to oracle machines. It is a resource-bounded counterpart to the arithmetical hierarchy and analytical hierarchy from mathematical logic.

External links:

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