Karatsuba Multiplication

Karatsuba Multiplication is a divide-and-conquer algorithm for fast integer multiplication that reduces the computational complexity of multiplying two n-digit numbers by recursively decomposing them into smaller parts and combining results with fewer multiplicative operations than the classical quadratic-time method.

103

Publications

2.9K

Citations

238

Authors

112

Institutions

Publications per year

2017–2026

43

Authors

238

  1. SL
    Shuguo Li

    Tsinghua University, China

    7 publications · 196 citations

    7

    h-index

  2. HK
    Howon Kim

    Pusan National University, South Korea

    6 publications · 132 citations

    6

    h-index

  3. CL
    Chiou‐Yng Lee

    Lunghwa University of Science and Technology, Taiwan

    5 publications · 96 citations

    5

    h-index

  4. PK
    Pramod Kumar Meher

    Nanyang Technological University, Singapore

    4 publications · 85 citations

    4

    h-index

  5. AM
    Asep Muhamad Awaludin

    Pusan National University, South Korea

    4 publications · 91 citations

    4

    h-index

1–5 of 238

Venues

  1. IEEE Transactions on Computers

    12 publications · 543 citations

    12

    h-index

  2. 7

    h-index

  3. 5

    h-index

  4. IEEE Access

    4 publications · 114 citations

    4

    h-index

  5. 3

    h-index

1–5