There exists a well known concrete bound on the discriminant of a number field by Minkowski.
Are there any concrete (completely explicit) improvements of this bound?
I know of a bound by Odlyzko, but it is only asymptotic, and thus not explicit/concrete enough. In particular, I do not know how to apply this bound to a number field of degree (say) $7$.
That is, I am looking for a bound on the discriminant as a function of the degree $n$ of the number field over $\mathbb{Q}$ (improving Minkowski's bound even if $n$ is not too large). I am most interested in the case of at most two real embeddings.