Sciweavers

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

84

Voted

ECCC
2002

52views more ECCC 2002»

Computing Elementary Symmetric Polynomials with a Sub-Polynomial Number of Multiplications

15 years 2 months ago

Computing Elementary Symmetric Polynomials with a Sub-Polynomial Number of Multiplications

Download www.cs.elte.hu

Vince Grolmusz

Real-time Traffic

ECCC 2002 |

claim paper

Related Content

» Computing fAb via Least Squares Polynomial Approximations

» Periodic symmetric functions serial addition and multiplication with neural networks

» Multiple target detection using Bayesian learning

» Lower Bounds for Dynamic Algebraic Problems

» Price based protocols for fair resource allocation convergence time analysis and extension...

» Stackelberg Strategies and Collusion in Network Games with Splittable Flow

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2002
Where	ECCC
Authors	Vince Grolmusz

Comments (0)