Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition

DOI10.1007/978-3-031-14788-3_8OpenAlexW4302333077MaRDI QIDQ2109980FDOQ2109980

Chenqi Mou, Mingyu Dong

Publication date: 21 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-14788-3_8

Recommendations

• Chordal graphs in triangular decomposition in top-down style
• On the chordality of polynomial sets in triangular decomposition in top-down style
• Chordality preserving incremental triangular decomposition and its implementation
• Algorithms for computing triangular decompositions of polynomial systems
• Algorithms for computing triangular decomposition of polynomial systems

zbMATH Keywords

sparsitytriangular decompositionimplementationchordal graph

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The RegularChains library in Maple 10
• Algebraic approaches to stability analysis of biological systems
• Title not available (Why is that?)
• Elimination methods
• A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
• Decomposing polynomial systems into simple systems
• On the theories of triangular sets
• Comprehensive Triangular Decomposition
• Title not available (Why is that?)
• A new method for solving algebraic systems of positive dimension
• Stability analysis of biological systems with real solution classification
• Title not available (Why is that?)
• Basic principles of mechanical theorem proving in elementary geometries
• Title not available (Why is that?)
• An elimination method for polynomial systems
• Triangular sets for solving polynomial systems: a comparative implementation of four methods
• Maximum cardinality search for computing minimal triangulations of graphs
• Algorithms for computing triangular decomposition of polynomial systems
• Characteristic set algorithms for equation solving in finite fields
• A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers
• Algorithmic Thomas decomposition of algebraic and differential systems
• Title not available (Why is that?)
• Decomposing polynomial sets into simple sets over finite fields: the positive-dimensional case
• Solving zero-dimensional algebraic systems
• Attacking Bivium and Trivium with the Characteristic Set Method
• Chordality Preserving Incremental Triangular Decomposition and Its Implementation
• On the Chordality of Polynomial Sets in Triangular Decomposition in Top-Down Style
• A zero structure theorem for polynomial-equations-solving and its applications
• Chordal graphs in triangular decomposition in top-down style
• On the Chordality of Simple Decomposition in Top-Down Style
• Chordal Networks of Polynomial Ideals
• Ritt-Wu's decomposition algorithm and geometry theorem proving

Cited In (2)

• A vertex incremental approach for maintaining chordality
• On the Chordality of Simple Decomposition in Top-Down Style

Uses Software

• Epsilon
• RegularChains
• SINGULAR
• Wsolve
• Chordal

This page was built for publication: Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition

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