Lower bound

A lower bound in mathematics or computer science refers to the minimum possible value or limit that a particular measure, such as time or resources, can have for solving a problem. It establishes a baseline, indicating that no algorithm or method can perform better than this limit under worst-case conditions. In essence, it tells us the least amount of effort or cost needed to guarantee a solution, helping us understand the fundamental difficulty of a problem and set realistic expectations for optimization.