Computational complexity

(In Computer science) Computational complexity. Whereas computability theory asks whether a problem can be computed, computational complexity theory asks how efficiently computable problems can be computed.

Articles

• quantamagazine.org/complexity-theorys-50-year-journey-to-the-limits-of-knowledge-20230817/

See also

• Asymptotic notation