Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Adrien Poteaux XLIM-DMI (UMR CNRS 6172), Limoges, France
Marc Rybowicz XLIM-DMI (UMR CNRS 6172), Limoges, France
Published in:
Cover Image
 
· Proceeding
ISSAC '08 Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Pages 239-246
ACM New York, NY, USA ©2008
table of contents ISBN: 978-1-59593-904-3 doi>10.1145/1390768.1390802
Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields Published by ACM 2008 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 7
· Downloads (cumulative): 99
· Citation Count: 3


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