Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach
From MaRDI portal
Publication:2818203
DOI10.1137/151002666zbMath1353.13033arXiv1411.1745OpenAlexW2295465424MaRDI QIDQ2818203
Diego Cifuentes, Pablo A. Parrilo
Publication date: 6 September 2016
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.1745
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (7)
The m-Bézout bound and distance geometry ⋮ Chordal Networks of Polynomial Ideals ⋮ Chordal graphs in triangular decomposition in top-down style ⋮ Exploiting sparsity for semi-algebraic set volume computation ⋮ On the robust hardness of Gröbner basis computation ⋮ Chordal ⋮ Choosing better variable orderings for cylindrical algebraic decomposition via exploiting chordal structure
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity
- Binomial edge ideals and conditional independence statements
- Solving multiple right hand sides linear equations
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials
- Schur products and matrix completions
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Cohen-Macaulay graphs
- Algorithmic graph theory and perfect graphs
- Efficient incremental algorithms for the sparse resultant and the mixed volume
- Algebraic characterization of uniquely vertex colorable graphs
- Triangulated graphs and the elimination process
- Graph-Coloring Ideals
- Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases
- On the Desirability of Acyclic Database Schemes
- The Use of Linear Graphs in Gauss Elimination
- Sparse Gröbner bases
- Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz
- Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
- Complexity of Finding Embeddings in a k-Tree
- A Polyhedral Method for Solving Sparse Polynomial Systems
- Monomial Algebras
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- A column approximate minimum degree ordering algorithm
- Fast Software Encryption
This page was built for publication: Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach
