Maximal quotient rational reconstruction: An almost optimal algorithm for rational reconstruction

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2004, Pages 243-249

  Monagan, Michael ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Euclidean Algorithm; Modular Algorithms; Rational Reconstruction

Indexed keywords

COMPUTATIONAL COMPLEXITY; IMAGE RECONSTRUCTION; PROBLEM SOLVING;

EUCLIDEAN ALGORITHM; MODULAR ALGORITHMS; RATIONAL RECONSTRUCTION;

ALGORITHMS;

EID: 27644457134     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. E. A. Arnold. Modular algorithms for computing Gröbner bases. J. Symbolic Computation 35, pp. 403-419, 2003.
2. G. E. Collins and M. J. Encarnacion. Efficient Rational Number Reconstruction. J. Symbolic Computation 20, pp. 287-297, 1995.
3. M. J. Encarnacion. Computing GCDs of Polynomials over Algebraic Number Fields. J. Symbolic Computation 20, pp. 299-313, 1995.
4. J. von zur Gathen and J. Gerhard. Modern Computer Algebra. University of Cambridge Press, 1999.
5. The GNU Multiple Precision Arithmetic Library. Copyright, Free Software Foundation, Inc. (2002). http://www.gnu.org/software/gmp/gmp.html
6. M. van Hoeij, M. Monagan. A Modular GCD Algorithm over Number Fields Presented with Multiple Field Extensions. Proceedings of ISSAC '2002, ACM Press, pp. 109-116, 2002.
7. T. Jebclean. Improving the Multiprecision Euclidean Algorithm. Proceedings of DISCO '93, Springer-Verlag LNCS 722, pp. 45-58, 1993.
8. J. de Kleine, M. Monagan. A Modular Design and Implementation of Buchberger's Algorithm. Proceedings of the Rhine Workshop on Computer Algebra, 2002.
9. D. E. Knuth. The Art of Computer Programming: Volume 2 Seminumerical Algorithms Third Edition. Addison Wesley, section 4.5.3., 1998.
10. L. Langemyr, S. McCallum. The Computation of Polynomial GCD's over an Algebraic Number Field. J. Symbolic Computation 8, pp. 429-448, 1989.
11. L. Langemyr. An Asymptotically Fast Probabilistic Algorithm for Computing Polynomial GCD's over an Algebraic Number Field. Proc. of AAECC '90, Springer-Verlag LNCS 508, pp. 222-233, 1991.
12. P .L Montgomery. An FFT Extension of the Elliptic Curve Method of Factorization. PhD thesis, University of California, Los Angeles, 1992.
13. V .Y Pan, X. Wang. Acceleration of the Euclidean Algorithm and Extensions. Proceedings of ISSAC '02, ACM Press, pp. 207-213, 2002.
14. A. Schönhage. Schnelle Berechnung von Kettenbruchenwicklungen. Acta Infomatica 1 pp. 139-144, 1971.
15. A. Steel (2003). Private communication.
16. P. S. Wang. A p-adic Algorithm for Univariate Partial Fractions. Proceedings of SYMSAC '81, ACM Press, pp 212-217, 1981.
17. P. S. Wang, M. J. T. Guy, J. H. Davenport, p-adic Reconstruction of Rational Numbers. SIGSAM Bulletin, 16, No 2, 1982.
18. P. S. Wang, M. J. T. Guy, J. H. Davenport. Early detection of true factors in Univariate Polynomial Factorization. Proceedings of EUROCAL '83, Springer-Verlag LNCS 162, pp. 225-235.