I have something of this kind:
$$(n-1) d m + m + 2m*v+2v^2 + v$$
Where all n,d,m,v are variables.
My little knowledge of computational complexity leads to do this kind of approximation:
$$ O( (n-1) d m + mv + v^2 )$$
However I feel I could further simplify into
$$ O( n d m + mv + v^2 )$$
$$ O( n d m + v^2 )$$
Are my assumptions correct?
- can I remove the $-1$ from $(n-1)$?
- can I remove $mv$ since $v$ will grow $v^2$ any way?