Chordal graphs in triangular decomposition in top-down style
From MaRDI portal
Publication:2200301
DOI10.1016/j.jsc.2019.10.011zbMath1443.05132arXiv1811.11023OpenAlexW2980517378MaRDI QIDQ2200301
Yang Bai, Chenqi Mou, Jiahua Lai
Publication date: 19 September 2020
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.11023
Symbolic computation and algebraic computation (68W30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph representations (geometric and intersection representations, etc.) (05C62) Solving polynomial systems; resultants (13P15)
Related Items (5)
Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros ⋮ Exploiting variable sparsity in computing equilibria of biological dynamical systems by triangular decomposition ⋮ Choosing better variable orderings for cylindrical algebraic decomposition via exploiting chordal structure ⋮ On the Chordality of Simple Decomposition in Top-Down Style ⋮ Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for computing triangular decomposition of polynomial systems
- Characteristic set algorithms for equation solving in finite fields
- Algorithmic Thomas decomposition of algebraic and differential systems
- A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers
- A facial reduction algorithm for finding sparse SOS representations
- Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case
- Lagrangian constraints and differential Thomas decomposition
- Elimination methods
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- Decomposing polynomial systems into simple systems
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Mechanical theorem proving in geometries. Basic principles. Transl. from the Chinese by Xiaofan Jin and Dongming Wang
- An elimination method for polynomial systems
- Computing triangular systems and regular systems
- Sparse FGLM algorithms
- On the theories of triangular sets
- Triangular sets for solving polynomial systems: a comparative implementation of four methods
- A characterisation of rigid circuit graphs
- A new algorithmic scheme for computing characteristic sets
- Decomposing polynomial sets into simple sets over finite fields: the positive-dimensional case
- Triangulated graphs and the elimination process
- Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach
- Attacking Bivium and Trivium with the Characteristic Set Method
- The Use of Linear Graphs in Gauss Elimination
- Sparse Gröbner bases
- Complexity of Finding Embeddings in a k-Tree
- Algorithmic Aspects of Vertex Elimination on Graphs
- Predicting Structure in Sparse Matrix Computations
- Towards Mixed Gröbner Basis Algorithms
- On the Chordality of Polynomial Sets in Triangular Decomposition in Top-Down Style
- Chordal Networks of Polynomial Ideals
- Advances in Cryptology - CRYPTO 2003
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
This page was built for publication: Chordal graphs in triangular decomposition in top-down style
