The following pages link to Local decomposition algorithms (Q3975184):
Displaying 15 items.
- Random arithmetic formulas can be reconstructed efficiently (Q488050) (← links)
- Gröbner bases for polynomial systems with parameters (Q607062) (← links)
- Gröbner bases and primary decomposition of polynomial ideals (Q1117277) (← links)
- Computing combinatorial decompositions of rings (Q1180429) (← links)
- Computation of real radicals of polynomial ideals. II (Q1380019) (← links)
- Ideal basis and primary decompositions: case of two variables (Q1821556) (← links)
- The calculation of radical ideals in positive characteristic (Q1864889) (← links)
- Prime decompositions of radicals in polynomial rings (Q1892144) (← links)
- Algorithms in local algebra (Q1907271) (← links)
- Deterministic normal position transformation and its applications (Q2006776) (← links)
- Effective algorithm for computing Noetherian operators of zero-dimensional ideals (Q2100118) (← links)
- Computing generators of the ideal of a smooth affine algebraic variety (Q2643543) (← links)
- An Implementation Of The Dual Local Decomposition Method (Q3360662) (← links)
- An FGLM-like algorithm for computing the radical of a zero-dimensional ideal (Q4599692) (← links)
- (Q4782509) (← links)
