Generating random factored numbers, easily

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Generating random factored numbers, easily

Full text

Pdf (90 KB)

Source

Symposium on Discrete Algorithms archive
Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms table of contents

San Francisco, California

Pages: 412 - 412

Year of Publication: 2002

ISBN:0-89871-513-X

Author

Adam Kalai

M.I.T.

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Society for Industrial and Applied Mathematics Philadelphia, PA, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 25, Citation Count: 0

Additional Information:

references collaborative colleagues

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

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	Eric Bach, Analytic methods in the analysis and design of number-theoretic algorithms, Massachusetts Institute of Technology, Cambridge, MA, 1985
	2	Eric Bach, How to generate factored random numbers, SIAM Journal on Computing, v.17 n.2, p.179-193, April 1988 [doi>10.1137/0217012]
	3	Eric Bach , Jeffrey Shallit, Algorithmic number theory, MIT Press, Cambridge, MA, 1996

Collaborative Colleagues:

Adam Kalai: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player