3 Apr
2016
3 Apr
'16
2:04 p.m.
On Sunday, April 3, 2016, Henry Baker <hbaker1@pipeline.com> wrote:
I just found a really cool polynomial decomposition algorithm which works beautifully for polys over GF(p) whose degree is <p, i.e., particularly those which are permutation polynomials. I believe this algorithm is due to Ms. Susan Landau (now @ WPI), although I can't be 100% sure about this w/o asking her.
I know Susan Landau, and I am 99% sure she would rather be called "Dr. Landau" or "Prof. Landau" than "Ms. Landau". (Though there are worse things you could call her, I guess, like "Mrs. Neil Immerman".) Jim Propp