SU\G(𝔾)/K·U

Fast Decomposition of Polynomials with Known Galois Group

Andreas Enge, François Morain

Type: Book-Chapter

Publication Date: 2003-01-01

Citations: 22

DOI: https://doi.org/10.1007/3-540-44828-4_27

Locations

  • Lecture notes in computer science - View

Similar Works

Action Title Year Authors
+ PDF Chat Solvability by radicals from an algorithmic point of view 2001 Guillaume Hanrot
François Morain
+ Computing Galois Groups 2018 Juliusz BrzeziƄski
+ Computing Galois Groups 2012 David A. Cox
+ An Algorithm for Solving Solvable Polynomial Equations of Arbitrary Degree by Radicals 2022 Song Li
+ PDF Chat Q-adic transform revisited 2008 Jean‐Guillaume Dumas
+ Computing Gretest Common Divisors and Factorizations in Quadratic Number Fields 1989 Erich Kaltofen
Heinrich Rolletschek
+ The Breakthrough: Galois Theory 2007 Roger Cooke
+ Computation of the splitting field of a dihedral polynomial 2006 Guénaël Renault
+ Radical Representation of Polynomial Roots 2002 Hirokazu Anai
Kazuhiro Yokoyama
+ Galois theory, splitting fields and computer algebra 2006 Gema M. Diaz–Toca
+ PDF Chat Solving Polynomial Systems over Finite Fields: Algorithms, Implementation and Applications 2013 Chenqi Mou
+ Implementation of a p-adic package for polynomial factorization and other related operations 2005 Paul S. Wang
+ Q-adic Floating-point Transform revisited: arithmetic over small extension field via floating point routines 2007 Jean‐Guillaume Dumas
+ Fields 1994 Stephan Foldes
+ Factoring Multivariate Polynomials Represented by Black Boxes: A Maple + C Implementation 2022 Tian Chen
Michael Monagan
+ A Classical Introduction to Galois Theory 2012 Stephen C. Newman
+ Arithmétique rapide pour des corps finis 2019 Robin Larrieu
+ FAST16 : A software program for factorising polynomials over large GF(p) 2006 Alain Poli
M. C. Gennero
+ Around the numeric–symbolic computation of differential Galois groups 2006 Joris van der Hoeven
+ POLYNOMIALS BELONGING TO GALOIS GROUP AND IT’S SOLVABILITY PROBLEMS 2024 Pritee Pritee
Manjeet Jakhar

Works That Cite This (15)

Action Title Year Authors
+ Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic 2010 Luca De Feo
+ Fast arithmetics in Artin–Schreier towers over finite fields 2011 Luca De Feo
Éric Schost
+ PDF Chat Explicit isogenies in quadratic time in any characteristic 2016 Luca De Feo
Cyril Hugounenq
JérÎme Plût
Éric Schost
+ PDF Chat Computing Class Polynomials for Abelian Surfaces 2014 Andreas Enge
Emmanuel Thomé
+ Computing class polynomials for abelian surfaces. 2013 Andreas Enge
Emmanuel Thomé
+ Computing class polynomials for abelian surfaces 2013 Andreas Enge
Emmanuel Thomé
+ PDF Chat Computing Igusa class polynomials 2013 Marco Streng
+ Dual Elliptic Primes and Applications to Cyclotomy Primality Proving 2007 Preda Mihăilescu
+ PDF Chat Accelerating the CM method 2012 Andrew V. Sutherland
+ PDF Chat Implementing the asymptotically fast version of the elliptic curve primality proving algorithm 2006 François Morain

Works Cited by This (7)

Action Title Year Authors
+ Comparing Invariants for Class Fields of Imaginary Quadratic Fields 2002 Andreas Enge
François Morain
+ PDF Chat Elliptic curves and primality proving 1993 A. O. L. Atkin
François Morain
+ Vorlesungen uber die Theorie der Algebraischen Zahlen. 1924 L. E. Dickson
E. Hecke
+ PDF Chat Computing subfields in algebraic number fields 1990 John D. Dixon
+ On Computing Subfields 1997 JĂŒrgen KlĂŒners
Michael Pohst
+ PDF Chat Solvability by radicals from an algorithmic point of view 2001 Guillaume Hanrot
François Morain
+ PDF Chat On computing subfields. A detailed description of the algorithm 1998 JĂŒrgen KlĂŒners