Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Greedy Approach to the Canny-Emiris Formula   The Canny-Emiris formula gives the sparse resultant as a ratio between the
determinant of a Sylvester-type matrix and a minor of it, by a subdivision
algorithm. The most complete proof of the formula was given by D'Andrea et al.
under general conditions on the underlying mixed subdivision. Before the proof,
Canny and Pedersen had proposed a greedy algorithm which provides smaller
matrices, in general. The goal of this paper is to give an explicit class of
mixed subdivisions for the greedy approach such that the formula holds, and the
greedy approach reduces the dimensions of the matrices are reduced compared to
the subdivision algorithm We measure this reduction for the case when the
Newton polytopes are zonotopes generated by n line segments (where n is the
rank of the underlying lattice), and for the case of multihomogeneous systems.
This article comes with a JULIA implementation of the treated cases.

21
The categories of this paper are: adap-org
19
The categories of this paper are: eess
1
The categories of this paper are: cs
30
The categories of this paper are: q-alg
23
The categories of this paper are: solv-int
32
The categories of this paper are: atom-ph
3
The categories of this paper are: physics
16
The categories of this paper are: stat
8
The categories of this paper are: hep-ex
35
The categories of this paper are: mtrl-th
31
The categories of this paper are: ao-sci
12
The categories of this paper are: nucl-th
20
The categories of this paper are: acc-phys
14
The categories of this paper are: math-ph
36
The categories of this paper are: cmp-lg
10
The categories of this paper are: q-bio