Theorems in computational complexity theory

In computational complexity theory, a theorem typically refers to a proven statement or result about the inherent difficulty of computational problems, particularly concerning the resources required (such as time or space) for their solution.