Article ID Journal Published Year Pages File Type
10325717 Journal of Symbolic Computation 2011 19 Pages PDF
Abstract
► 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.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Artificial Intelligence
Preview
Properness defects of projection and minimal discriminant variety
Authors
,