Algorithmic properties of maximal orders in simple algebras over Q
Author:
- 1 September 1992
- journal article
- research article
- Published by Springer Nature in computational complexity
- Vol. 2 (3) , 225-243
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Computing irreducible representations of finite groupsMathematics of Computation, 1990
- Algebraic Number Theory1986
- Polynomial time solutions of some problems of computational algebra1985
- Factorization of polynomials over finite fields and factorization of primes in algebraic number fields1984
- Associative Algebras1982
- A Classical Introduction to Modern Number Theory1982
- An algorithm for computing modular forms on Γ0(N)Journal of Algebra, 1980
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer MatrixSIAM Journal on Computing, 1979
- Systems of distinct representatives and linear algebraJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967
- Introduction to Quadratic Forms1963