Sciweavers

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

4

DAGSTUHL
2006

favoriteEmaildiscussreport

93views Software Engineering» more DAGSTUHL 2006»

Two Families of Algorithms for Symbolic Polynomials

13 years 5 months ago

Two Families of Algorithms for Symbolic Polynomials

Download www.csd.uwo.ca

Stephen M. Watt

Real-time Traffic

DAGSTUHL 2006 | DAGSTUHL 2007 |

claim paper

Related Content

» Two Efficient Algorithms for Arithmetic of Elliptic Curves Using Frobenius Map

» The Tensor Product of Two Codes Is Not Necessarily Robustly Testable

» Adaptive Genetic Programming Applied to New and Existing Simple Regression Problems

» Optimizing redundancy using MDS codes and dynamic symbol allocation in mobile ad hoc netwo...

» From Feasible Proofs to Feasible Computations

» An exact method for the biobjective onemachine problem with maximum lateness and unit fami...

» Modular static scheduling of synchronous dataflow networks an efficient symbolic represent...

» Computing the rank and a small nullspace basis of a polynomial matrix

» An Elimination Method for Solving Bivariate Polynomial Systems Eliminating the Usual Drawb...

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2006
Where	DAGSTUHL
Authors	Stephen M. Watt

Comments (0)