Pages that link to "Item:Q1358933"

The following pages link to A modular method for computing the Galois groups of polynomials (Q1358933):

Displaying 8 items.

• Gröbner basis of the alternating Galoisian ideal (Q629348) (← links)
• Exact algorithms for \(p\)-adic fields and epsilon constant conjectures (Q733352) (← links)
• Efficient arithmetic in successive algebraic extension fields using symmetries (Q1948674) (← links)
• Computing Galois groups of polynomials (especially over function fields of prime characteristic) (Q2348291) (← links)
• A parallel multi-modular algorithm for computing Lagrange resolvents (Q2643525) (← links)
• Using Galois ideals for computing relative resolvents (Q5927988) (← links)
• Galois group computation for rational polynomials (Q5927989) (← links)
• Special issue: Algorithmic methods in Galois theory (Q5929829) (← links)