The Magma Algebra System I: The User Language

By W. Bosma, John J. Cannon, Catherine Playoust. 1997

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Geppetto: Versatile Verifiable Computation (2015, methodology): “Unfortunately, there are drawbacks to using the curves Ben-Sasson et al. found.”
Symmetry in Integer Linear Programming (2010, methodology): “However, efficient algorithms (such as nauty [77], Saucy [32], as part of MAGMA [ 10 ] or GAP [113]) are available and perform satisfactorily in many instances.”
Bounding Picard numbers of surfaces using p-adic cohomology (2006, methodology): “1 Implementation notes Using the Magma algebra system [5], we have developed an implementation of the methods of this paper, to obtain an algorithm for computing approximate Frobenius matrices in rigid cohomology for smooth surfaces in projective 3-space over a prime finite field.”
Basic results on braid groups (2010, background): “The MAGMA computational algebra system also makes this kind of computations in braid groups [15].”
A quasi quadratic time algorithm for hyperelliptic curve point counting (2006, methodology): “This was done with the the Magma computer algebra system, version 2.10 [ BCP97 ], for any genus.”
Automorphisms of Order 2p in Binary Self-Dual Extremal Codes of Length a Multiple of 24 (2013, unknown): “All computations of the last part are carried out with MAGMA [6].”
Algebraic Statistics for Computational Biology: Preface (2005, methodology): “Includes a new fast implementation of the Faugère F4 algorithm for computing Gröbner bases [Bosma et al., 1997].”