Exponentiation Algorithms
Exponentiation Algorithms is a class of computational methods within number-theoretic algorithms that specialize in efficiently computing the result of raising a base integer to an exponent under modular arithmetic, particularly optimizing for large exponents through techniques such as repeated squaring and residue reduction.
520
Publications
30.6K
Citations
966
Authors
478
Institutions
Publications per year
2017–2026
62
Parents
520
Quantum networks for elementary arithmetic operations
Vlatko Vedral, Adriano Barenco, Artur Ekert · Physical Review A · 1996 · 822 citations · Full text
Computing, Computer Science, Physics +17
1–5 of 520
966
9
h-index
8
h-index
7
h-index
Centre National de la Recherche Scientifique, France
7 publications · 369 citations
7
h-index
7
h-index
1–5 of 966
478

Centre National de la Recherche Scientifique
Paris, France
12 h-index
23 publications
1.1K citations
IBM (United States)
Armonk, United States
11 h-index
15 publications
2.2K citations
Massachusetts Institute of Technology
Cambridge, United States
10 h-index
14 publications
2.4K citations
École Polytechnique
Palaiseau, France
8 h-index
12 publications
692 citations

UNSW Sydney
Sydney, Australia
8 h-index
8 publications
443 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
8 h-index
12 publications
317 citations
Harvey Mudd College
Claremont, United States
7 h-index
16 publications
570 citations
Oregon State University
Corvallis, United States
7 h-index
9 publications
1.4K citations
1–8 of 478
43 publications · 2.9K citations
29
h-index
MCOM · 19 publications · 3.1K citations
15
h-index
17 publications · 678 citations
15
h-index
10 publications · 297 citations
10
h-index
10 publications · 202 citations
10
h-index
1–5