On the Chordality of Simple Decomposition in Top-Down Style
From MaRDI portal
Publication:5014670
DOI10.1007/978-3-030-43120-4_12OpenAlexW3010937111MaRDI QIDQ5014670
Publication date: 8 December 2021
Published in: Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-43120-4_12
Related Items
Choosing better variable orderings for cylindrical algebraic decomposition via exploiting chordal structure ⋮ Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for computing triangular decomposition of polynomial systems
- Algorithmic Thomas decomposition of algebraic and differential systems
- A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers
- 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
- Symbolic detection of steady states of autonomous differential biological systems by transformation into block triangular form
- On the theories of triangular sets
- Decomposing polynomial sets into simple sets over finite fields: the positive-dimensional case
- Chordal graphs in triangular decomposition in top-down style
- Triangulated graphs and the elimination process
- Attacking Bivium and Trivium with the Characteristic Set Method
- The Use of Linear Graphs in Gauss Elimination
- Algorithmic Aspects of Vertex Elimination on Graphs
- Predicting Structure in Sparse Matrix Computations
- On the Chordality of Polynomial Sets in Triangular Decomposition in Top-Down Style
- Chordal Networks of Polynomial Ideals
