Hi,
my name is Katja Sophie Hotz and I am studying Technical Mathematics at the
Vienna University of Technology.
I'm in the last year of my master and have specialized in Mathematics in
Computer Science.
I would like to work on the GSoC project "Univariate polynomials over
algebra
iki/GSoC-2013-Application-Katja-Sophie-Hotz:-Faster-Algorithms-for-Polynomials-over-Algebraic-Number-Fields>
. As far as I can see these algorithms would be new to SymPy.
I would be very grateful for any feedback.
Thank you in advance,
Katja Sophie
--
You received this message because y
As far as I know, the modular gcd algorithm and the factorization algorithm
from my proposal
can be extended to algebraic function fields, but I don't think there will
be enough time to go that far in one summer.
--
You received this message because you are subscribed to the Google Groups
"sym
I was unsure how the two algorithms compare, this is why I didn't include
the integer polynomial case in my proposal.
But it would be great to also work on this case.
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To unsubscribe from this group and s
