Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

70

ISSAC
2001
Springer

favoriteEmaildiscussreport

89views Mathematics» more ISSAC 2001»

Univariate polynomials: nearly optimal algorithms for factorization and rootfinding

15 years 3 months ago

Univariate polynomials: nearly optimal algorithms for factorization and rootfinding

Download comet.lehman.cuny.edu

Victor Y. Pan

Real-time Traffic

ISSAC 2001 | Mathematics |

claim paper

Related Content

» Univariate Polynomials Nearly Optimal Algorithms for Numerical Factorization and Rootfindi...

» Extractors and condensers from univariate polynomials

» Fast separable factorization and applications

» On the Virtues of Generic Programming for Symbolic Computation

» A hierarchical approach to efficient reinforcement learning in deterministic domains

» Datastreams and histograms

» On the complexity of scheduling in wireless networks

» Derandomizing homomorphism testing in general groups

» Waitfree consensus with infinite arrivals

Post Info
More Details (n/a)

Added	30 Jul 2010
Updated	30 Jul 2010
Type	Conference
Year	2001
Where	ISSAC
Authors	Victor Y. Pan

Comments (0)