Fast reduction and composition of binary quadratic forms

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Fast reduction and composition of binary quadratic forms

Full text

Pdf (441 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1991 international symposium on Symbolic and algebraic computation table of contents

Bonn, West Germany

Pages: 128 - 133

Year of Publication: 1991

ISBN:0-89791-437-6

Author

Arnold Schönhage

Universität Bonn, Germany

Sponsors

GMD : German Natl Research Ctr for Information Tech. - Gesellschft
German Comp Soc : GI - Gesellshaft for Informatik
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 27, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/120694.120711 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	C.S. Iliopoulos, Analysis of an algorithm for composition of binary quadratic forms, J. Algorithms 3 (1982) 157-159.
	2	Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
	3	J.C. Lagarias, Worst-case complexity bounds for algorithms in the theory of integral quadratic forms, J. Algorithms 1 (1980) 142-186.
	4	A. K. Lenstra , H. W. Lenstra, Jr., Algorithms in number theory, Handbook of theoretical computer science (vol. A): algorithms and complexity, MIT Press, Cambridge, MA, 1991
	5	N. W. Rickert, Efficient reduction of quadratic forms, Proceedings of the third conference on Computers and mathematics, p.135-139, May 1989, Boston, Massachusetts, United States
	6	A. SchSnhage, Schnelle Berechnung yon Kettenbruchentwicklungen. Acta Informatica 1 (1971) 139-144.
	7	A. Sch6nhage, Tapes versus pointers, a study in implementing fast algorithms, EATC$ Bull. 30 (1986)23-32.

CITED BY 2

	Friedrich Eisenbrand, Short vectors of planar lattices via continued fractions, Information Processing Letters, v.79 n.3, p.121-126, 07/31/2001
	Thomas Lickteig, Preface: Festschrift in honor of Arnold Schönhage, Journal of Complexity, v.21 n.4, p.372-376, August 2005