Gauss' algorithm revisited
- 31 December 1991
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 12 (4) , 556-572
- https://doi.org/10.1016/0196-6774(91)90033-u
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbersMathematics of Computation, 1988
- Factoring Polynomials over Algebraic Number FieldsSIAM Journal on Computing, 1985
- From Fermat to MinkowskiPublished by Springer Nature ,1985
- Integer Programming with a Fixed Number of VariablesMathematics of Operations Research, 1983
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- Worst-case complexity bounds for algorithms in the theory of integral quadratic formsJournal of Algorithms, 1980