Properness defects of projection and minimal discriminant variety

► Minimal discriminant variety is reduced to properness defect computation. ► Properness defect is reduced to variable elimination. ► Upper bound on the complexity of properness defect computation is proved. ► Upper bound on the degree of the minimal discriminant variety is proved.