From: Debajyoti Dasgupta (debajyotidasgupta6_at_[hidden])
Date: 2020-01-23 02:47:33
Thank you for the information sir, I am highly interested in this project
and looking forward to work with this project as I believe completing this
project will have a great impact in many scientific areas and
researches too and I would be very happy to contribute to it.
On Thu, Jan 23, 2020 at 2:59 AM Christopher Kormanyos <e_float_at_[hidden]>
> Dear Debajyoti,
> Yes. Toom-Cook is one part of the potential plans,
> in addition to other issues mentioned in the proposal.
> Thank you for your interest. There is a process for this.
> First Boost must apply for acceptance to the program.
> After that, we begin accepting applications for the
> The application process is competitive
> because it is a world-open competition. We can
> offer some tips during this competition, but
> it's mostly up to you to write a good application
> that realistically reflects project awareness and
> interest in and/or similar kinds of experience
> in the domain of the project.
> The GSoC is for students.
> So you are not expected to be a world expert with
> years and years of experience. But project awareness,
> having basic knowledge about the fundamental technical
> issues relevant to the domain, all helps.
> For the projects in Multiprecision, I will be directly
> involved with help from colleagues much more experienced
> than I am. So i will usually be on the board and be able
> to answer questions if they are fair in view of the
> The action tends to really get going toward the
> end of February if memory recalls.
> Good luck.
> Kind regards, Chris
> On Wednesday, January 22, 2020, 7:07:27 PM GMT+1, Debajyoti Dasgupta via
> Boost <boost_at_[hidden]> wrote:
> I am highly interested in working on the multiprecision big number types .
> I wanted to propose that since In the proposed project there is an increase
> in precision from 1000 to 10000 decimal digit , we can implement toom-cook
> algorithm instead of the standard karatsuba multiplication.Toom cook
> algorithm has a complexity of O(n^1.465) which is quite faster than
> karatsuba multiplication O(n^1.58). Please share your views on this.
> Thank you
> Unsubscribe & other changes:
-- *Debajyoti Dasgupta* *Student ID: 18CS30051* *Second Year Undergraduate Student* *Department Of Computer Science And Engineering* *Indian Institute of Technology Kharagpur* *Phone : 8327406555* *Facebook <https://www.facebook.com/debajyoti.dasgupta.6> | LinkedIn <https://www.linkedin.com/in/debajyoti-dasgupta-33713a179/>*
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk