Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case
From MaRDI portal
Recommendations
- Decomposing polynomial sets into simple sets over finite fields: the positive-dimensional case
- Simple decomposition of polynomial sets over finite fields
- Primary decomposition of zero-dimensional ideals over finite fields
- Computing the primary decomposition of zero-dimensional ideals
- Zero decomposition algorithms for systems of polynomial equations
Cites work
- scientific article; zbMATH DE number 1703931 (Why is no real title available?)
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 3970886 (Why is no real title available?)
- scientific article; zbMATH DE number 622670 (Why is no real title available?)
- scientific article; zbMATH DE number 1057759 (Why is no real title available?)
- scientific article; zbMATH DE number 217454 (Why is no real title available?)
- 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 method for solving algebraic systems of positive dimension
- Advances in Cryptology - CRYPTO 2003
- Algebraic Statistics for Computational Biology
- Algorithmic properties of polynomial rings
- Algorithms for computing triangular decompositions of polynomial systems
- An elimination method for polynomial systems
- Associative differential operations
- Basic principles of mechanical theorem proving in elementary geometries
- Computing triangular systems and regular systems
- Decomposing polynomial systems into simple systems
- Elimination methods
- On the theories of triangular sets
- Square-free algorithms in positive characteristic
- The RegularChains library in Maple 10
Cited in
(21)- Computing switching surfaces in optimal control based on triangular decomposition
- Computing strong regular characteristic pairs with Gröbner bases
- Simple decomposition of polynomial sets over finite fields
- Elimination theory in differential and difference algebra
- Characteristic set algorithms for equation solving in finite fields
- Zero decomposition with multiplicity for zero-dimensional polynomial systems
- A triangular decomposition algorithm for differential polynomial systems with elementary computation complexity
- Bifurcation analysis and complex dynamics of a Kopel triopoly model
- scientific article; zbMATH DE number 2064110 (Why is no real title available?)
- On the efficiency of solving Boolean polynomial systems with the characteristic set method
- Computing equilibria of semi-algebraic economies using triangular decomposition and real solution classification
- On product decomposition
- scientific article; zbMATH DE number 5990116 (Why is no real title available?)
- Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros
- Ritt-Wu characteristic set method for Laurent partial differential polynomial systems
- Chordal graphs in triangular decomposition in top-down style
- Stability analysis for discrete biological models using algebraic methods
- Decomposing polynomial sets into simple sets over finite fields: the positive-dimensional case
- scientific article; zbMATH DE number 2221412 (Why is no real title available?)
- Relative U-set and its applications to an irreducible decomposition algorithm
- Zero decomposition algorithms for systems of polynomial equations
This page was built for publication: Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q630689)
