Examples for

Computational Complexity

A main idea of computational complexity theory is that of complexity classes, which group computer algorithms according to how their time and memory needs scale with the size of their input. Wolfram|Alpha has information on most of the known relationships between these classes and the well-known algorithms associated with them.
Complexity Classes

Find subset, superset, membership and equality relations between complexity classes and algorithms and explore deterministic, nondeterministic, space-bounded, time-bounded and quantum algorithm classes, among others.

Get information about a complexity class:

non-deterministic polynomial time
complexity class BPP

Compare complexity classes:

NC vs NLINSPACE

Determine relationships between classes:

Is BPL in QP?
More examples