Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
6
search results - page 2 / 2
»
Parallel Linear Congruential Generators with Prime Moduli
Sort
relevance
views
votes
recent
update
View
thumb
title
26
click to vote
CORR
2007
Springer
173
views
Education
»
more
CORR 2007
»
Computing modular polynomials in quasi-linear time
13 years 7 months ago
Download
www.ens-lyon.fr
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
Andreas Enge
claim paper
Read More »
« Prev
« First
page 2 / 2
Last »
Next »