Sciweavers

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

100

ALGORITHMICA
2008

36views more ALGORITHMICA 2008»

Algorithms for Modular Counting of Roots of Multivariate Polynomials

15 years 2 months ago

Algorithms for Modular Counting of Roots of Multivariate Polynomials

Download www.cs.cmu.edu

Parikshit Gopalan, Venkatesan Guruswami, Richard J

Real-time Traffic

ALGORITHMICA 2008 |

claim paper

Related Content

» Counting and locating the solutions of polynomial systems of maximum likelihood equations ...

» How Hard is 3View Triangulation Really

» Finding Small Roots of Bivariate Integer Polynomial Equations Revisited

» The DMM bound multivariate aggregate separation bounds

» On the Genericity of the Modular Polynomial GCD Algorithm

» Multivariate Polynomials Duality and Structured Matrices

» Modular Las Vegas algorithms for polynomial absolute factorization

» Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangemen...

» Fast computation of special resultants

Post Info
More Details (n/a)

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2008
Where	ALGORITHMICA
Authors	Parikshit Gopalan, Venkatesan Guruswami, Richard J. Lipton

Comments (0)