Mixed Subdivisions Suitable for the Greedy Canny–Emiris Formula
Mixed Subdivisions Suitable for the Greedy Canny–Emiris Formula
Abstract The Canny–Emiris formula (Canny and Emiris in International symposium on applied algebra, algebraic algorithms, and error-correcting codes, 1993) gives the sparse resultant as the ratio of the determinant of a Sylvester-type matrix over a minor of it, both obtained via a mixed subdivision algorithm. In Checa and Emiris (Proceedings …