Upper and lower bounds are usually stated using the big O notation, which hides constant factors and smaller terms. This makes the bounds independent of the specific details of the computational model used. For instance, if T(n) = 7n2 + 15n + 40, in big O notation one would write T(n) = O(n2).
Big O notation provides autonomy to upper and lower bounds with relationship to what? 
the computational model specific details of the computational model used the specific details of the computational model used
This makes the bounds independent of the specific details of the computational model used.
This makes the bounds independent of the specific details of the computational model used.
Big O notation provides autonomy to upper and lower bounds with relationship to what? 