P-adic Algorithms

p-Adic Algorithms is a computational framework in computational number theory that utilizes p-adic number systems to design efficient algorithms for solving arithmetic and algebraic problems by exploiting the unique convergence and lifting properties of p-adic metrics.

105

Publications

4K

Citations

138

Authors

105

Institutions

Publications per year

2017–2026

8

Authors

138

  1. AG
    Alan G. B. Lauder

    University of Oxford, United Kingdom

    3 publications · 76 citations

    3

    h-index

  2. PS
    Paul S. Wang

    Kent State University, United States

    3 publications · 237 citations

    3

    h-index

  3. AS
    Andrew Schumann

    University of Information Technology and Management in Rzeszow, Poland

    3 publications · 42 citations

    3

    h-index

  4. AB
    Amnon Besser

    Ben-Gurion University of the Negev, Israel

    2 publications · 50 citations

    2

    h-index

  5. FM
    Farrukh Mukhamedov

    International Islamic University Malaysia, Malaysia

    2 publications · 49 citations

    2

    h-index

1–5 of 138

Venues

  1. Journal of Number Theory

    6 publications · 117 citations

    6

    h-index

  2. Mathematics of Computation

    MCOM · 5 publications · 95 citations

    5

    h-index

  3. LMS Journal of Computation and Mathematics

    5 publications · 115 citations

    5

    h-index

  4. Journal of Symbolic Computation

    3 publications · 89 citations

    3

    h-index

  5. Journal de Théorie des Nombres de Bordeaux

    JTNB · 3 publications · 81 citations

    3

    h-index

1–5