The first that comes to my mind in this respect is the Berlekamp algorithm. Grepping for it in FriCAS gave me
http://fricas.github.io/api/FiniteFieldPolynomialPackage2 Is that what you wanted? Ralf On 05/13/2018 05:28 PM, Waldek Hebisch wrote: > It seems that we have no function to compute roots in > finite fields. There is discreteLog which can be used > to get roots but such computation is potentially much > more expensive than drect computation of roots. > I am missing something? -- You received this message because you are subscribed to the Google Groups "FriCAS - computer algebra system" group. To unsubscribe from this group and stop receiving emails from it, send an email to fricas-devel+unsubscr...@googlegroups.com. To post to this group, send email to fricas-devel@googlegroups.com. Visit this group at https://groups.google.com/group/fricas-devel. For more options, visit https://groups.google.com/d/optout.
