New algorithms for generating Conway polynomials over finite fields

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Lenwood S. Heath Department of Computer Science, Virginia Tech., Blacksburg, VA
Nicholas A. Loehr Department of Mathematics, University of California, San Diego, La Jolla, CA
Published in:
· Proceeding
SODA '99 Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Pages 429-437
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©1999
table of contents ISBN:0-89871-434-6
New algorithms for generating Conway polynomials over finite fields 1999 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 9
· Downloads (cumulative): 269
· Citation Count: 1


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder