Schnelle Multiplikation großer Zahlen

Schönhage, A., Strassen, V.·1971·Computing
DOI 10.1007/bf02242355

Cited by (1,000)

Items 701–800 of 1,000

  1. NP-Completeness
    Bernhard Körte, Jens Vygen · 2018 · Algorithms and combinatorics
  2. Quantum Cinema and Quantum Computing
    Renate C.-Z.-Quehenberger · 2022 · Springer eBooks
  3. Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables
    Светлана Николаевна Селезнева · 2013 · Computational Mathematics and Modeling
  4. Some Problems and Results in the Theory of Actually Computable Functions (preliminary abstract)
    Wolfgang Maass, Theodore A. Slaman · 1989 · Studies in logic and the foundations of mathematics
  5. Multiple Precision Floating-Point Arithmetic on SIMD Processors
    Joris van der Hoeven · 2017 · IEEE Symposium on Computer Arithmetic (ARITH)
  6. Improved method for finding optimal formulas for bilinear maps in a finite field
    Svyatoslav Covanov · 2019 · Theoretical Computer Science
  7. Modified Gamma Correction Companding for PAPR Reduction in OFDM Systems Considering Solid-State Power Amplifier and Wireless Channels
    Mohammad Mahmudul Hasan, Mohammad Mahadi Hasan Foad · 2018 · Circuits Systems and Signal Processing
  8. Complexity Theory, Proofs and Approximation
    Johan Håstad · 2009
  9. Fast Arbitrary Precision Floating Point on FPGA
    Johannes de Fine Licht, Christopher A. Pattison, Alexandros Nikolaos Ziogas, David Simmons–Duffin, Torsten Hoefler · 2022 · IEEE International Symposium on Field-Programmable Custom Computing Machines (FCCM)
  10. Elliptic periods and primality proving
    Tony Ezome, Reynald Lercier · 2012 · Journal of Number Theory
  11. JKL-ECM: an implementation of ECM using Hessian curves
    Henriette Heer, Gary McGuire, Oisín Robinson · 2016 · LMS Journal of Computation and Mathematics
  12. FHE over the integers and modular arithmetic circuits
    Eunkyung Kim, Mehdi Tibouchi · 2017 · IET Information Security
  13. Parallel Multiplication of Big Integer on GPU
    Jitendra Vikram Tembhurne · 2018 · Communications in computer and information science
  14. A new algorithm on the minimal rational fraction representation of feedback with carry shift registers
    Yubo Li, Zhichao Yang, Kangquan Li, Longjiang Qu · 2019 · Designs Codes and Cryptography
  15. #P-completeness of Counting Update Digraphs, Cacti, and Series-Parallel Decomposition Method
    Kévin Perrot, Sylvain Sené, Lucas Venturini · 2020 · Lecture notes in computer science
  16. The equivariant complexity of multiplication in finite field extensions
    Jean-Marc Couveignes, Tony Ezome · 2023 · Journal of Algebra
  17. Integer numeric multiplication using quantum Fourier transform
    Joseph L. Pachuau, Arnab Roy, Anish Kumar Saha · 2021 · Quantum Studies Mathematics and Foundations
  18. Calcul analytique
    Joris van der Hoeven · 2011 · Les cours du CIRM
  19. Carryless addition
    Anatoly V. Anisimov · 1996 · Cybernetics and Systems Analysis
  20. Binary Addition Chain on EREW PRAM
    Khaled Ahmed Mohamed Fathy, Hazem M. Bahig, Hatem M. Bahig, A. A. Ragb · 2011 · Lecture notes in computer science
  21. Nachsorge und Rehabilitation
    Peter Drings, Hendrik Dienemann, M. Wannenmacher · 2003 · Springer eBooks
  22. Parallel Algorithm for Multiplying Integer Polynomials and Integers
    Andrzej Chmielowiec · 2013 · Lecture notes in electrical engineering
  23. Basic Notions in Computational Complexity
    Tao Jiang, Ming Li, Bala Ravikumar · 2009 · Chapman & Hall/CRC applied algorithms and data structures series
  24. Efficient data mappings for parity-declustered data layouts
    Eric J. Schwabe, Ian M. Sutherland · 2004 · Theoretical Computer Science
  25. Segment LLL Reduction of Lattice Bases Using Modular Arithmetic
    Sanjay Mehrotra, Zhifeng Li · 2010 · Algorithms
  26. Relative class number of imaginary Abelian fields of prime conductor below 10000
    M. Shokrollahi · 1999 · Mathematics of Computation
  27. Functional programming concepts and straight-line programs in computer algebra
    N. Bruno, Joos Heintz, Guillermo Matera, Rosita Wachenchauzer · 2002 · Mathematics and Computers in Simulation
  28. Fast computation of common left multiples of linear ordinary differential operators
    Alin Bostan, Frédéric Chyzak, Ziming Li, Bruno Salvy · 2011 · ACM communications in computer algebra
  29. Conditions for the Existence of Fast Number Theoretic Transforms
    Kodek · 1981 · IEEE Transactions on Computers
  30. Towards an Implementation of a Computer Algebra System in a Functional Language
    Oleg Lobachev, Rita Loogen · 2008 · Lecture notes in computer science
  31. Can We Learn Algorithms from People Who Compute Fast: An Indirect Analysis in the Presence of Fuzzy Descriptions
    Olga M. Kosheleva, Владик Крейнович · 2011 · Studies in fuzziness and soft computing
  32. A randomized sublinear time parallel GCD algorithm for the EREW PRAM
    Jonathan Sorenson · 2009 · Information Processing Letters
  33. Комментарии к моим работам, написанные мной самим
    Anatolii Alekseevich Karatsuba · 2013 · Современные проблемы математики
  34. A Discrete Logarithm Attack on Elliptic Curves.
    Otto Johnston · 2010
  35. Fast Fourier Transforms over Prime Fields of Large Characteristic and their Implementation on Graphics Processing Units
    Davood Mohajerani · 2016 · Scholarship@Western (Western University)
  36. IP Core of Coprocessor for Multiple-Precision-Arithmetic Computations
    Kamil Rudnicki, Tomasz P. Stefański · 2018 · International Conference Mixed Design of Integrated Circuits and Systems
  37. Integer factoring and compositeness witnesses
    Jacek Pomykała, Maciej Radziejewski · 2020 · Journal of Mathematical Cryptology
  38. Some Extensions of the Bottleneck Paths Problem
    Tong-Wook Shinn, Tadao Takaoka · 2014 · Lecture notes in computer science
  39. Binary Segmentation for Multivariate Polynomials
    Jürgen Klose · 1995 · Journal of Complexity
  40. DOTMIX-Pro: faster and more efficient variants of DOTMIX for dynamic-multithreading platforms
    Robert Ritchie, Khodakhast Bibak · 2021 · The Journal of Supercomputing
  41. Some New Algorithms for High-Precision Computation of Euler’s Constant
    Richard P. Brent, Edwin M. McMillan · 1980 · Springer eBooks
  42. Matrix Multiplication, Trilinear Decompositions, APA Algorithms, and Summation
    Victor Ya. Pan · 2014 · arXiv (Cornell University)
  43. Computation of High-Precision Mathematical Constants in a Combined Cluster and Grid Environment
    Daisuke Takahashi, Mitsuhisa Sato, Taisuke Boku · 2006 · Lecture notes in computer science
  44. A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication
    Beate Bollig · 2010 · Lecture notes in computer science
  45. Towards an “Erlangen program” for general linear systems theory
    Reiner Manfred Creutzburg, Valery Labunets, E. V. Labunets · 2005 · Springer eBooks
  46. Components and projections of curves over finite fields
    Joachim von zur Gathen, Igor E. Shparlinski · 1994 · Lecture notes in computer science
  47. Algebraic and symbolic computation in digital signal processing, coding and cryptography
    Thomas Beth · 1985 · Lecture notes in computer science
  48. Long multiplication by instruction sequences with backward jump instructions
    Jan Aldert Bergstra, Cornelis A. Middelburg · 2013 · arXiv (Cornell University)
  49. Multiplication is the easiest nontrivial arithmetic function
    Helmut Alt · 1983 · Annual Symposium on Foundations of Computer Science
  50. A new algorithm for computing primitive elements in the field of Gaussian complex integers modulo a Mersenne prime
    I.S. Reed, T. K. Truong, Robert Miller · 1979 · IEEE Transactions on Acoustics Speech and Signal Processing
  51. The fast Fourier transform by polynomial evaluation
    David K. Kahaner · 1978 · Zeitschrift für angewandte Mathematik und Physik
  52. Testing permutation polynomials
    Joachim von zur Gathen · 1989 · Annual Symposium on Foundations of Computer Science
  53. Transformation of divide & conquer to nested parallel loops
    Christoph A. Herrmann, Christian Lengauer · 1997 · Lecture notes in computer science
  54. Using higher-order Fourier analysis over general fields
    Arnab Bhattacharyya, Abhishek Bhowmick · 2015 · arXiv (Cornell University)
  55. Multipartite Modular Multiplication
    Pascal Giorgi A, Laurent Imbert A, Thomas Izard A · 2011 · HAL
  56. Computerizing Mathematics: Logic and Computation
    Michael J. Beeson · 1995 · Computerkultur
  57. Trimmed FFTs and Applications to Coding and Secret Sharing
    Hongru Cao, Sian-Jheng Lin, Weiming Zhang · 2025 · IEEE Transactions on Communications
  58. Reconfigurable Radix-2/4/8 of Unified 2 N Points NTT-INTT for Homomorphic Encryption
    Infall Syafalni, Nicholas Teffandi, Fauzan Ibrahim, Indira Pramudita, Nana Sutisna, Trio Adiono · 2025 · IEEE International Symposium on Circuits and Systems proceedings
  59. A review on quantum Fourier transform
    Tomás Barros, Pablo Álvarez, Bárbara Vidal, Mauricio Solar · 2026 · Quantum Information Processing
  60. Smoothness testing of polynomials over finite fields
    Jean‐François Biasse, Michael J. Jacobson · 2014 · Advances in Mathematics of Communications
  61. On a Fast Algorithm for Computing the Fourier Transform
    Анна Андреевна Алексашкина, A. N. Kostromin, Yu. V. Nesterenko · 2021 · Moscow University Mathematics Bulletin
  62. Multi-digit arithmetic in sequential, parallel and quantum computational models
    V. K. Zadiraka, Andrii Tereshchenko, Інна Віталіївна Швідченко · 2023 · Physico-mathematical modelling and informational technologies
  63. Parallel Accelerating Number Theoretic Transform for Bootstrapping on a Graphics Processing Unit
    Huixian Li, Deng Pan, Jinglei Li, Hao Wang · 2024 · Mathematics
  64. UltraPrecise: A GPU-Based Framework for Arbitrary-Precision Arithmetic in Database Systems
    Xin Li, Mengbai Xiao, Dongxiao Yu, Rubao Lee, Xiaodong Zhang · 2024 · IEEE International Conference on Data Engineering (ICDE)
  65. A Novel Approach to Integer Factorization: A Paradigm in Cryptography
    Boykuziev Ilkhom, Angshuman Khan, Rupayan Das, Abdurakhimov Bakhtiyor Fayziyevich · 2025 · Concurrency and Computation Practice and Experience
  66. Roundoff-error-free QR factorization via integer-preserving Gram Schmidt orthogonalization
    Lorena Mejia-Domenzain, Christopher Lourenco, Erick Moreno‐Centeno · 2025 · Linear and Multilinear Algebra
  67. A New GCD Algorithm for Quadratic Number Rings with Unique Factorization
    Saurabh Agarwal, Gudmund Skovbjerg Frandsen · 2006 · Lecture notes in computer science
  68. On the Analysis of Public-Key Cryptologic Algorithms
    Andrea Miele · 2015 · Infoscience (Ecole Polytechnique Fédérale de Lausanne)
  69. Error-Correcting and Verifiable Parallel Inference in Graphical Models
    Negin Karimi, Petteri Kaski, Mikko Koivisto · 2020 · Proceedings of the AAAI Conference on Artificial Intelligence
  70. Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth
    Andrzej Lingas · 2020 · Theoretical Computer Science
  71. Linear average-case complexity of algorithmic problems in groups
    Alexander Yu. Olshanskii, Vladimir Shpilrain · 2025 · Journal of Algebra
  72. Pattern Analysis under Number Theoretic Transforms
    Claudio Moraga · 2012 · Lecture notes in computer science
  73. Application of Approximating Algorithms to Boolean Matrix Multiplication
    Lotti, Francesco Romani · 1980 · IEEE Transactions on Computers
  74. Subset-Restricted Random Walks for Pollard rho Method on ${\mathbf{F}_{p^m}}$
    Min‐Kyu Kim, Jung Hee Cheon, Jin Hong · 2009 · Lecture notes in computer science
  75. Computation of integral bases
    Jens-Dietrich Bauch · 2016 · Journal of Number Theory
  76. An Algorithm for Canonical Forms of Finite Subsets of $$\mathbb {Z}^d$$ Z d up to Affinities
    Giovanni Paolini · 2017 · Discrete & Computational Geometry
  77. Computing prime divisors in an interval
    Minkyu Kim, Jung Hee Cheon · 2014 · Mathematics of Computation
  78. An algorithm for multiple-precision floating-point multiplication
    Daisuke Takahashi · 2004 · Applied Mathematics and Computation
  79. High throughput long integer multiplication using Fast Fourier Transform on parallel workstation
    Jitendra Vikram Tembhurne, Shailesh R. Sathe · 2014 · IEEE India Conference
  80. Embedded implementation of Edwards curve- and extended Jacobi quartic curve-based cryptosystems
    Chiara Peretti, Paolo Gastaldo, Marco Stramezzi, Rodolfo Zunino · 2013 · International Conference for Internet Technology and Secured Transactions
  81. Compound Means and Fast Computation of Radicals
    Ján Šustek · 2014 · Applied Mathematics
  82. Perfect power testing
    R. Balasubramanian, S. V. Nagaraj · 1996 · Information Processing Letters
  83. Efficient Multiplication on Low-Resource Devices
    Wolfgang Wieser, Michael Hutter · 2014 · Euromicro Conference on Digital System Design (DSD)
  84. A low complexity probabilistic test for integer multiplication
    Dima Yu. Grigoriev, Gérald Tenenbaum · 2010 · Journal of Complexity
  85. Discrete convolution with modulo operations
    Ricardo Ferré · 1991 · Applied Mathematics Letters
  86. A High-Performance Hardware Architecture for Spectral Hash Algorithm
    Ray C. C. Cheung, Çetin Kaya Koç, John D. Villasenor · 2009 · IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP)
  87. Easy Multiple-Precision Divisors and Word-RAM Constants
    Torben Hagerup · 2015 · Lecture notes in computer science
  88. Backtracking-assisted multiplication
    Houda Ferradi, Rémi Géraud, Diana Maimuţ, David Naccache, Hang Zhou · 2017 · Cryptography and Communications
  89. Seminumerical Algorithms for Computing Invariant Manifolds of Vector Fields at Fixed Points
    Àlex Haro, Josep–Maria Mondelo · 2016 · Applied mathematical sciences
  90. Normal bases from 1-dimensional algebraic groups
    Tony Ezome, Mohamadou Sall · 2019 · Journal of Symbolic Computation
  91. Univariate Polynomials with Long Unbalanced Coefficients as Bivariate Balanced Ones: A Toom–Cook Multiplication Approach
    Marco Bodrato, Alberto Zanoni · 2020 · Lecture notes in computer science
  92. Space-efficient evaluation of hypergeometric series
    Howard Cheng, Barry Gergel, Ethan Kim, Eugene V. Zima · 2005 · ACM SIGSAM Bulletin
  93. An ECC processor for IoT using Edwards curves and DFT modular multiplication
    Osama D. Al-Khaleel, Selçuk Baktır, Alptekın Küpçü · 2022 · Cluster Computing
  94. High-performance montgomery modular multiplier with NTT and negative wrapped convolution
    Hongfei Ke, Hao Li, Peiyong Zhang · 2023 · Microelectronics Journal
  95. Design Space Exploration for a Co-designed Accelerator Supporting Homomorphic Encryption
    Ghada Y. Abozaid, Ahmed El-Mahdy · 2015 · International Conference on Control Systems and Computer Science
  96. Quantum Mechanical Algorithm for Solving Quadratic Residue Equation
    Hong‐Fu Wang, Shou Zhang, Yongfang Zhao, Kyu-Hwang Yeon · 2009 · International Journal of Theoretical Physics
  97. A survey of techniques in applied computational complexity
    Robert Meersman · 1975 · Journal of Computational and Applied Mathematics
  98. Basic Polynomial Algebra Subprograms
    Changbo Chen, Svyatoslav Covanov, Farnam Mansouri, Marc Moreno Maza, Ning Xie, Yuzhen Xie · 2015 · ACM communications in computer algebra
  99. CALYPSO
    Giovanni Cesari · 1997 · Parallel Symbolic Computation
  100. Fast multiple-precision evaluation of elementary functions (1976)
    Richard P. Brent · 2016 · Springer eBooks