| 21. | And due to assumption ( ) this upper bound is integrable.
|
| 22. | The upper bound is attained by generalizing the inductive method of enumerating polyominoes.
|
| 23. | This is an upper bound, which is reached on most entries.
|
| 24. | The big O would suggest that the running time is an upper bound.
|
| 25. | Now suppose is a smaller upper bound for " S ".
|
| 26. | A set may have many upper bounds, or none at all.
|
| 27. | But this is a way way way way way too high upper bounds!
|
| 28. | According to, this upper bound was first observed by John R . Isbell.
|
| 29. | In contrast, the probabilistic definition requires that the integrals have an upper bound.
|
| 30. | This upper bound can be achieved only for 2, 3 or 4 marks.
|
