Decomposing polynomial sets into simple sets over finite fields: the positive-dimensional case
From MaRDI portal
Publication:1935795
Recommendations
- Simple decomposition of polynomial sets over finite fields
- Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case
- scientific article; zbMATH DE number 1860723
- Primary decomposition of zero-dimensional ideals over finite fields
- scientific article; zbMATH DE number 1465647
Cited in
(17)- Characteristic decomposition: from regular sets to normal sets
- Elimination theory in differential and difference algebra
- Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition
- Chordal graphs in triangular decomposition in top-down style
- Computing strong regular characteristic pairs with Gröbner bases
- On product decomposition
- scientific article; zbMATH DE number 5990116 (Why is no real title available?)
- Computing equilibria of semi-algebraic economies using triangular decomposition and real solution classification
- Simple decomposition of polynomial sets over finite fields
- Decomposition of polynomial sets into characteristic pairs
- On the Chordality of Simple Decomposition in Top-Down Style
- Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case
- Comprehensive characteristic decomposition of parametric polynomial systems
- Choosing variable orderings based on elimination tree for sparse triangular decomposition
- Simple characteristic decomposition of polynomial sets
- Complexity analysis of triangular decomposition over F₂ with strongly chordal graphs
- Strongly and transitive chordal graphs and their applications in complexity analysis of triangular decomposition
This page was built for publication: Decomposing polynomial sets into simple sets over finite fields: the positive-dimensional case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1935795)