Lower Bounds

„ Lower bounds are hard because they make claims about all possible algorithms in the set of algorithms being studied.