Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal

Details:

   
TitleThe FGLM problem and M\"oller
Author(s) Teo Mora
TypeBook, Chapter in Book, Conference Proceeding
AbstractMöller’s Algorithm is a procedure which, given a set of linear functionals defining a zero-dimensional 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 FGLM-Problem (deduced with good complexity the lex Gröbner basis of a zero-dim. ideal given by another easy-to-be-computed Gröbner basis of the same ideal).

ISBN978-3-540-93805-7/hbk; 978-3-5
URL http://link.springer.com/chapter/10.1007%2F978-3-540-93806-4_3
LanguageEnglish
Pages27--45
PublisherBerlin: Springer
Year2009
Edition0
Translation No
Refereed No
Webmaster