Details:
Title  The FGLM problem and M\"oller  Author(s)  Teo Mora  Type  Book, Chapter in Book, Conference Proceeding  Abstract  Möller’s Algorithm is a procedure which, given a set of linear functionals defining a zerodimensional polynomial ideal, allows to compute, with good complexity,
a set of polynomials which are triangular/bihortogonal to the given functionals;
at least a “minimal” polynomial which vanishes to all the given functionals;
a Gröbner basis of the given ideal.
As such Möller’s Algorithm has applications
when the functionals are point evaluation (where the only relevant informations are the bihortogonal polynomials);
as an interpretation of Berlekamp–Massey Algorithm (such interpretation is due to Fitzpatrick) where the deduced minimal vanishing polynomial is the key equation;
as an efficient solution of the FGLMProblem (deduced with good complexity the lex Gröbner basis of a zerodim. ideal given by another easytobecomputed Gröbner basis of the same ideal).
 ISBN  9783540938057/hbk; 97835 
URL 
http://link.springer.com/chapter/10.1007%2F9783540938064_3 
Language  English  Pages  2745  Publisher  Berlin: Springer  Year  2009  Edition  0  Translation 
No  Refereed 
No 
