These are lower bounds, the typical frequency is expected to be much higher.

To find lower bounds for all cases involved solving around 100,000 linear programming problems.

When upper and lower bounds are imposed on the same variable it is important to note that means.

Moreover, better lower bounds are known for several classes of graph properties.

In terms of proving lower bounds, our knowledge is very limited.

There has been some progress on lower bounds, as reported by .

A set S is bounded if it has both upper and lower bounds.

Separate values for the upper and lower bounds may also be used.

This hypothesis is used to show very many lower bounds on algorithms in computer science.

The Levenshtein distance has several simple upper and lower bounds.