On the Chordality of Simple Decomposition in Top-Down Style

DOI10.1007/978-3-030-43120-4_12MaRDI QIDQ5014670zbMATH OpenOpenAlexFDO

Authors Chenqi Mou, Jiahua Lai

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

zbMATH Keywords

chordal graphsimple decompositiontop-down styletriangular system

Mathematics Subject Classification ID

Numerical analysis (65-XX) Computer science (68-XX)

Recommendations

• On the chordality of polynomial sets in triangular decomposition in top-down style
• On the chordality of ordinary differential triangular decomposition in top-down style
• Chordal graphs in triangular decomposition in top-down style
• Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition
• A decomposition theorem for chordal graphs and its applications
• Chordal graphs, higher independence and vertex decomposable complexes
• scientific article; zbMATH DE number 1355644
• Chordality of clutters with vertex decomposable dual and ascent of clutters
• Higher chordality: from graphs to complexes
• Simplicial orders and chordality

Cites work

• A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers
• A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
• A new efficient algorithm for computing Gröbner bases (F₄)
• Algorithmic Aspects of Vertex Elimination on Graphs
• Algorithmic Thomas decomposition of algebraic and differential systems
• Algorithms for computing triangular decomposition of polynomial systems
• An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• An elimination method for polynomial systems
• Attacking Bivium and Trivium with the characteristic set method
• Chordal graphs in triangular decomposition in top-down style
• Chordal networks of polynomial ideals
• Computing triangular systems and regular systems
• Decomposing polynomial sets into simple sets over finite fields: the positive-dimensional case
• Decomposing polynomial systems into simple systems
• Elimination methods
• scientific article; zbMATH DE number 3970886 (Why is no real title available?)
• scientific article; zbMATH DE number 1206418 (Why is no real title available?)
• scientific article; zbMATH DE number 1263377 (Why is no real title available?)
• scientific article; zbMATH DE number 622670 (Why is no real title available?)
• scientific article; zbMATH DE number 1979251 (Why is no real title available?)
• Lagrangian constraints and differential Thomas decomposition
• Mechanical theorem proving in geometries. Basic principles. Transl. from the Chinese by Xiaofan Jin and Dongming Wang
• On the chordality of polynomial sets in triangular decomposition in top-down style
• On the theories of triangular sets
• Predicting Structure in Sparse Matrix Computations
• Symbolic detection of steady states of autonomous differential biological systems by transformation into block triangular form
• The Use of Linear Graphs in Gauss Elimination
• Triangulated graphs and the elimination process

Cited in

(4)

• Choosing better variable orderings for cylindrical algebraic decomposition via exploiting chordal structure
• Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition
• On the chordality of ordinary differential triangular decomposition in top-down style
• Choosing the variable ordering for cylindrical algebraic decomposition via exploiting chordal structure

This page was built for publication: On the Chordality of Simple Decomposition in Top-Down Style

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014670)