[GSoC2014] Efficient Groebner bases and their applications

[Zamrath Nizam]

Hi everyone,

I am Zamrath Nizam, pursuing BSc (Hons) degree in Electronic and Telecommunication Engineering
at University of Moratuwa, Sri Lanka. I would like to work with SymPy this year in accordance with
Google Summer of Code 2014. Particularly I like Symbolic mathematics and Programming most and
thought to start with this intriguing platform. Hope this open community platform for Computer Algebra
System (CAS) would long live as seeing the fact huge number of applicants through this from GSoC.

As I have completed modules related to Linear Algebra and Computer programming (Algorithm, Software
development, etc) in my university career I have decided to work with "Efficient Groebner bases and
their applications" idea which I found here. And I have intended on laying an algorithm in which it
determines the better algorithm at differing criterion. The scope of this project could be maximized at will
of the mentor who could be assigned.

At the mean time I have set a pull request on Improving speed of polynomial's degree() calculation which
had been marked as an issue.

And at a glance could anyone please give me the status of the Groebner bases project up to now (only if
it went beyond the idea in idealist) and assign a prospective mentor who can bring the views on this
project to earth by supporting me.

Thank you.

Regards,
Zamrath Nizam