Sciweavers

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

33

Voted

CORR
2008
Springer

favoriteEmaildiscussreport

104views Education» more CORR 2008»

Stable normal forms for polynomial system solving

13 years 11 months ago

Stable normal forms for polynomial system solving

Download hal.archives-ouvertes.fr

This paper describes and analyzes a method for computing border bases of a zero-dimensional ideal I. The criterion used in the computation involves specific commutation polynomials and leads to an algorithm and an implementation extending the one provided in [29]. This general border basis algorithm weakens the monomial ordering requirement for Gr

Bernard Mourrain, Philippe Trebuchet

Real-time Traffic

Border Basis | CORR 2008 | Education | Gr¨obner Bases | Specific Commutation Polynomials |

claim paper

Related Content

» Generalized normal forms and polynomial system solving

» A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite syste...

» Dynamic normal forms and dynamic characteristic polynomial

» Call by Need Computations to RootStable Form

» Underspecified computation of normal forms

» On the Stable Paths Problem

» Equilibria Fixed Points and Complexity Classes

» Fast algorithms for finding proper strategies in game trees

» Solving Alternating Boolean Equation Systems in Answer Set Programming

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Bernard Mourrain, Philippe Trebuchet

Comments (0)