Decomposing polynomial sets into simple sets over finite fields: the positive-dimensional case
From MaRDI portal
Publication:1935795
DOI10.1016/j.tcs.2012.11.009zbMath1259.68244OpenAlexW2036549578MaRDI QIDQ1935795
Dongming Wang, Xiaoliang Li, Chenqi Mou
Publication date: 19 February 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.11.009
Symbolic computation and algebraic computation (68W30) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Finite fields (field-theoretic aspects) (12E20)
Related Items (8)
Chordal graphs in triangular decomposition in top-down style ⋮ Computing equilibria of semi-algebraic economies using triangular decomposition and real solution classification ⋮ Characteristic decomposition: from regular sets to normal sets ⋮ Elimination theory in differential and difference algebra ⋮ Computing strong regular characteristic pairs with Gröbner bases ⋮ Decomposition of polynomial sets into characteristic pairs ⋮ On the Chordality of Simple Decomposition in Top-Down Style ⋮ Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition
Uses Software
This page was built for publication: Decomposing polynomial sets into simple sets over finite fields: the positive-dimensional case