Pages that link to "Item:Q5927988"
From MaRDI portal
The following pages link to Using Galois ideals for computing relative resolvents (Q5927988):
Displaying 16 items.
- Algebraic computation of resolvents without extraneous powers (Q444389) (← links)
- Dynamic Galois theory (Q607055) (← links)
- Gröbner basis of the alternating Galoisian ideal (Q629348) (← links)
- Homotopy techniques for multiplication modulo triangular sets (Q651881) (← links)
- Bit-size estimates for triangular sets in positive dimension (Q657656) (← links)
- Computation of the decomposition group of a triangular ideal (Q1762559) (← links)
- Efficient arithmetic in successive algebraic extension fields using symmetries (Q1948674) (← links)
- Computing strong regular characteristic pairs with Gröbner bases (Q2229717) (← links)
- Galois theory, splitting fields and computer algebra (Q2457393) (← links)
- On approximate triangular decompositions in dimension zero (Q2470055) (← links)
- Change of order for regular chains in positive dimension (Q2476011) (← links)
- A parallel multi-modular algorithm for computing Lagrange resolvents (Q2643525) (← links)
- PARALLEL COMPUTATION OF RESOLVENTS BY MULTIMODULAR TECHNIQUES AND DECOMPOSITION FORMULA (Q2909489) (← links)
- New simple algorithms for computing the minimal polynomial of cos(2π/n) (Q4595247) (← links)
- Algebraic certification of numerical algorithms computing Lagrange resolvents (Q4599698) (← links)
- ON THE FIELD INTERSECTION PROBLEM OF SOLVABLE QUINTIC GENERIC POLYNOMIALS (Q4929867) (← links)
