Pages that link to "Item:Q1864896"
From MaRDI portal
The following pages link to Computing the primary decomposition of zero-dimensional ideals (Q1864896):
Displaying 19 items.
- An efficient algorithm for factoring polynomials over algebraic extension field (Q365855) (← links)
- Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case (Q630689) (← links)
- Evaluation techniques for zero-dimensional primary decomposition (Q1030246) (← links)
- Gröbner bases and primary decomposition of polynomial ideals (Q1117277) (← links)
- Direct methods for primary decomposition (Q1209132) (← links)
- Computation of the decomposition group of a triangular ideal (Q1762559) (← links)
- A modular method to compute the rational univariate representation of zero-dimensional ideals (Q1808670) (← links)
- The decision of prime and primary ideal (Q1942148) (← links)
- Deterministic normal position transformation and its applications (Q2006776) (← links)
- Computing PUR of zero-dimensional ideals of breadth at most one (Q2121179) (← links)
- On the primary decomposition of some determinantal hyperedge ideal (Q2211185) (← links)
- Normal projection: deterministic and probabilistic algorithms (Q2258914) (← links)
- Parallelization of modular algorithms (Q2430024) (← links)
- Computing zero-dimensional schemes (Q2456531) (← links)
- On inverse systems and squarefree decomposition of zero-dimensional polynomial ideals (Q2457334) (← links)
- Primary decomposition of zero-dimensional ideals over finite fields (Q3055105) (← links)
- A Modified Van der Waerden Algorithm to Decompose Algebraic Varieties and Zero-Dimensional Radical Ideals (Q3598000) (← links)
- An FGLM-like algorithm for computing the radical of a zero-dimensional ideal (Q4599692) (← links)
- On the structure of ideals in a family of skew polynomial rings (Q6580162) (← links)
