Squaring Up by Selection: NP-Completeness at Three Simple Roots
To solve an overdetermined polynomial system numerically, one first makes it square, usually by replacing the given equations with as many random linear combinations as there are unknowns. This is a provably safe step, but it can substantially enlarge the supports. The alternative is to keep that many of the given equa...