Finding maximal orders in semisimple algebras over Q
Computational Complexity
Lattice basis reduction for indefinite forms and an application
FPSAC '93 Proceedings of the 5th conference on Formal power series and algebraic combinatorics
The MAGMA algebra system I: the user language
Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Efficient solution of rational conics
Mathematics of Computation
Some improvements to 4-descent on an elliptic curve
ANTS-VIII'08 Proceedings of the 8th international conference on Algorithmic number theory
Hi-index | 0.00 |
We give an algorithm for finding an isomorphism of a given central simple algebra of degree 4 over the rationals and the full matrix algebra, provided it exists. It reduces the task to classical problems in number theory, for which there are already known algorithms.