English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The Sch\"onhage-Strassen algorithm (SSA) is the de-facto standard formultiplication of large integers. For $N$-bit numbers it has a time bound of$O(N \cdot \log N \cdot \log \log N)$. De, Kurur, Saha and Saptharishi (DKSS)presented an asymptotically faster algorithm with a better time bound of $N\cdot \log N \cdot 2^{O(\log^* N)}$. In this diploma thesis, results of animplementation of DKSS multiplication are presented: run-time is about 30 timeslarger than SSA, while memory requirements are about 3.75 times higher thanSSA. A possible crossover point is estimated to be out of reach even if weutilized the whole universe for computer memory.

Fast Multiplication of Large Integers: Implementation and Analysis of the DKSS Algorithm