Sciweavers

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

52

SIAMCOMP
2008

favoriteEmaildiscussreport

72views more SIAMCOMP 2008»

Query-Efficient Algorithms for Polynomial Interpolation over Composites

14 years 9 months ago

Query-Efficient Algorithms for Polynomial Interpolation over Composites

Download research.microsoft.com

Parikshit Gopalan

Real-time Traffic

SIAMCOMP 2008 |

claim paper

Related Content

» Parallel sparse polynomial interpolation over finite fields

» Computing modular polynomials in quasilinear time

» A Deterministic Multivariate Interpolation Algorithm for Small Finite Fields

» On factorization of multivariate polynomials over algebraic number and function fields

» Interpolation of depth3 arithmetic circuits with two multiplication gates

» Factoring polynomials via polytopes

» Parameter choices and a better bound on the list size in the GuruswamiSudan algorithm for ...

» AverageCase Complexity of Learning Polynomials

» Fast Modular Composition in any Characteristic

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2008
Where	SIAMCOMP
Authors	Parikshit Gopalan

Comments (0)