39 citations · 143 across the 11 of their papers we have counts for
Showing cs.SCShow all
3 papers · 1 filter
cs.SC2019
On the Complexity of Toric Ideals
Diego Cifuentes, Shmuel Onn
We investigate the computational complexity of problems on toric ideals such as normal forms, Gröbner bases, and Graver bases. We show that all these problems are strongly NP-hard…
cs.SC2016★ 16 cited
Chordal networks of polynomial ideals
Diego Cifuentes, Pablo A. Parrilo
We introduce a novel representation of structured polynomial ideals, which we refer to as chordal networks. The sparsity structure of a polynomial system is often described by a gr…
cs.SC2014★ 29 cited
Exploiting chordal structure in polynomial ideals: a Gröbner bases approach
Diego Cifuentes, Pablo Parrilo
Chordal structure and bounded treewidth allow for efficient computation in numerical linear algebra, graphical models, constraint satisfaction and many other areas. In this paper,…