Schnelle Multiplikation großer Zahlen

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

Cited by (1,000)

Items 801–900 of 1,000

  1. Subquadratic-Time Algorithms for Normal Bases
    Mark W. Giesbrecht, Armin Jamshidpey, Éric Schost · 2021 · Computational Complexity
  2. Computation of π Using Arithmetic-Geometric Mean
    Eugene Salamin · 1976 · Springer eBooks
  3. AT2-optimal galois field multiplier for VLSI
    Martin Fürer, Kurt Mehlhorn · 1986 · Lecture notes in computer science
  4. Methods for the calculation of values of a norm form
    Attila Bérczes, József Ködmön · 2003 · Publicationes Mathematicae Debrecen
  5. On the power of nonconservative PRAM
    Anders Dessmark, Andrzej Lingas · 1996 · Lecture notes in computer science
  6. Combinatorial decomposition approaches for efficient counting and random generation FPTASes
    Roméo Rizzi, Alexandru Ioan Tomescu · 2013 · arXiv (Cornell University)
  7. Exact Enumeration and Sampling of Matrices with Specified Margins
    Jeffrey W. Miller, Matthew Tom Harrison · 2011 · arXiv (Cornell University)
  8. Multiplication of large integers by the use of modular arithmetic
    Daniel Guinier · 1990 · ACM SIGSAC Review
  9. The computational complexity of recognizing permutation functions
    Keju Ma, Joachim von zur Gathen · 1994 · ACM Symposium on Theory of Computing (STOC)
  10. Parallel exponentiators using data signal processor chips and transputers for a flexible and efficient software implementation of public-key cryptosystems to run on PC's or larger systems
    Daniel Guinier · 1989 · ACM SIGSAC Review
  11. Study on processing performance of optical modulo operations
    Kouichi Nitta, Nobuto Katsuta, Osamu Matoba · 2008 · Journal of Physics Conference Series
  12. THE RANK OF A PAIR OF MATRICES AND CONVOLUTION
    D. Yu. Grigor'ev · 1979 · Russian Mathematical Surveys
  13. A fast algorithm for computing a complex-number theoretic transform for long sequences
    I.S. Reed, T. K. Truong, B. Benjauthrit, Chen-Mie Wu · 1981 · IEEE Transactions on Acoustics Speech and Signal Processing
  14. An efficient method for the computation of the Feigenbaum constants to high precision
    Molteni, Andrea · 2016 · arXiv (Cornell University)
  15. Modular Multiplication Algorithm Suitable For Low-Latency Circuit Implementations.
    Erdinç Öztürk · 2019 · IACR Cryptology ePrint Archive
  16. Non-Rectangular Convolutions and (Sub-)Cadences with Three Elements
    Mitsuru Funakoshi, Julian Pape-Lange · 2019 · arXiv (Cornell University)
  17. A strategy to optimize the complexity of Chudnovsky-type algorithms over the projective line
    Stéphane Ballet, Alexis Bonnecaze, Bastien Pacifico · 2022 · Contemporary mathematics - American Mathematical Society
  18. Interactive proof systems and alternating time-space complexity
    Lance Fortnow, Carsten Lund · 2005 · Springer eBooks
  19. Polynomial time certifying algorithms for the planar quantified integer programming problem
    Z. Liang, K. Subramani, Joachim Worthington · 2012 · Journal of Logic and Computation
  20. Exact Matrix Factorization Updates for Nonlinear Programming
    Adolfo R. Escobedo · 2023 · INFORMS journal on computing
  21. Minimizing I/O in Toom-Cook Algorithms
    Roy Nissim, Oded Schwartz, Yuval Spiizer · 2024 · Lecture notes in computer science
  22. Peregrine: Accelerating TFHE Bootstrapping on GPUs via Multi-Level External Product Co-Design
    Haoqi He, Zhiwei Wang, Lutan Zhao, Dian Jiao, Dan Meng, Rui Hou · 2026 · IEEE International Symposium on High-Performance Computer Architecture (HPCA)
  23. Fast computation of the number of solutions to x12+⋯+xk2≡λ(modn)
    J. M. Grau, Antonio M. Oller‐Marcén · 2018 · Journal of Number Theory
  24. Ramanujan, Modular Equations, and Approximations to Pi or How to Compute One Billion Digits of Pi
    Jonathan Michael Borwein, Peter Borwein, David H. Bailey · 2000 · Springer eBooks
  25. Sequential and parallel sliding window algorithms for multiplying large integers
    Hazem M. Bahig, Khaled Ahmed Mohamed Fathy · 2023 · Journal of King Saud University - Computer and Information Sciences
  26. Decidability of Membership Problems for Flat Rational Subsets of \(\boldsymbol{{\textrm{GL}}(2,\boldsymbol{{\mathbb{Q}}})}\) and Singular Matrices
    Volker Diekert, Igor Potapov, Pavel Semukhin · 2024 · SIAM Journal on Computing
  27. Complex pseudo-partition functions in the Configurationally-Resolved Super-Transition-Array approach for radiative opacity
    Jean‐Christophe Pain · 2025 · High Energy Density Physics
  28. Reducing T-Depth and T-Count in Quantum Multiplication Using Compressor Primitives
    Siyi Wang, Suman Dutta, Wei Jie Bryan Lee, Jerrie Feng, Xiang Fang, Anupam Chattopadhyay · 2025 · ACM Great Lakes Symposium on VLSI (GLSVLSI)
  29. Space-Efficient and Noise-Robust Quantum Factoring
    Seyoon Ragavan, Vinod Vaikuntanathan · 2026 · Journal of Cryptology
  30. Applications of FFT and Structured Matrices
    Ioannis Z. Emiris, Victor Ya. Pan · 2009 · Chapman & Hall/CRC applied algorithms and data structures series
  31. A New Algorithm for Long Integer Cube Computation with Some Insight into Higher Powers
    Marco Bodrato, Alberto Zanoni · 2012 · Lecture notes in computer science
  32. Karatsuba-ZOT Multiplication Algorithm and its Application in Cryptography
    Shahram Jahani, Azman Samsudin · 2012 · Applied Mechanics and Materials
  33. Scientific achievements of Anatolii Alekseevich Karatsuba
    Марис Евгеньевич Чанга, Sergey Alexandrovich Gritsenko, Ekatherina Anatol'evna Karatsuba, Maxim Aleksandrovich Korolev, Irina Sergeevna Rezvyakova, Дойчин Иванов Толев · 2013 · Proceedings of the Steklov Institute of Mathematics
  34. Spectral modular arithmetic for binary extension fields
    Gökay Saldamlı, Yoo-Jin Baek, Çetin Kaya Koç · 2011 · IEEE International Conference on Communication Software and Networks
  35. The computational complexity and approximability of a series of geometric covering problems
    Michael Khachay, M. I. Poberii · 2013 · Proceedings of the Steklov Institute of Mathematics
  36. Research on FFT-Based Large Integers Multiplication
    Xianjin Fang, Jingzhao Li, Yu-xiu Guo · 2009 · International Conference on Information Science and Engineering
  37. Primeless Factoring-Based Cryptography
    Sonia Bogos, Ioana Boureanu, Serge Vaudenay B · 2013 · Lecture notes in computer science
  38. An Efficient Gatekeeper Algorithm for Detecting GxE
    Jimmy Thomas Efird · 2010 · Cancer Informatics
  39. Complexity of computations
    Michael O. Rabin · 2007 · ACM eBooks
  40. Arbitrary-Precision Arithmetics on the GPU
    Bernhard Langer · 2015
  41. Научные достижения Анатолия Алексеевича Карацубы
    Сергей Александрович Гриценко, Sergey Alexandrovich Gritsenko, Екатерина Анатольевна Карацуба, Ekatherina Anatol'evna Karatsuba, Максим Александрович Королeв, Maxim Aleksandrovich Korolev, Ирина Сергеевна Резвякова, Irina Sergeevna Rezvyakova, Дойчин Иванов Толев, Dojchin Ivanov Tolev et al. · 2012 · Современные проблемы математики
  42. Быстрое вычисление константы Каталана через приближения, полученные преобразованиями типа куммеровских
    Екатерина Анатольевна Карацуба, Ekatherina Anatol'evna Karatsuba · 2013 · Дискретная математика
  43. Implementation of Multiple-Precision Floating-Point Arithmetic on Intel Xeon Phi Coprocessors
    Daisuke Takahashi · 2016 · Lecture notes in computer science
  44. Numerical analysis of Elias's and Peres's deterministic extractors
    Amonrat Prasitsupparote, Norio Konno, Junji Shikata · 2017 · Conference on Information Sciences and Systems
  45. Efficient Computation of the Characteristic Polynomial of a Threshold Graph
    Martin Fürer · 2015 · Lecture notes in computer science
  46. Refinement of a newton reciprocal algorithm for arbitrary precision numbers
    Yiping Cheng, Ze Liu · 2016 · IEEE International Conference on Progress in Informatics and Computing
  47. Detection of Primes in the Set of Residues of Divisors of a Given Number
    Rafał Bystrzycki · 2018 · Lecture notes in computer science
  48. Improving Multiple Precision Integer Multiplication on GPUs
    Makoto Miyazaki, Susumu Matsumae · 2017 · International Symposium on Computing and Networking
  49. Multiprecision ANSI C Library for Implementation of Cryptographic Algorithms on Microcontrollers
    Jan Riha, Jakub Klemsa, Martin Novotný · 2019 · Mediterranean Conference on Embedded Computing (MECO)
  50. On efficiency of notations for natural numbers
    Konrad Zdanowski · 2022 · Theoretical Computer Science
  51. Fast Multiple-Precision Evaluation of Elementary Functions
    Richard P. Brent · 2004 · Springer eBooks
  52. NP-Completeness
    Bernhard Körte, Jens Vygen · 2011 · Algorithms and combinatorics
  53. Reduction-Free Multiplication for Finite Fields and Polynomial Rings
    Samira Carolina Oliva Madrigal, Gökay Saldamlı, Chen Li, Yue Geng, Jing Tian, Zhongfeng Wang, Çetin Kaya Koç · 2023 · Lecture notes in computer science
  54. In-place accumulation of fast multiplication formulae
    Jean‐Guillaume Dumas, Bruno Grenet · 2024 · International Symposium on Symbolic and Algebraic Computation
  55. Fully Homomorphic Encryption for Embedded Systems: IP Core Design and Implementation
    Amandeep Kaur, Nagendra Gajjar, Vijay Savani · 2024 · Algorithms for intelligent systems
  56. From Rational Number Reconstruction to Set Reconciliation and File Synchronization
    Antoine Amarilli, Fabrice Benhamouda, Florian Bourse, Robin Morisset, David Naccache, Pablo Rauzy · 2013 · Lecture notes in computer science
  57. The Blum-Blum-Shub Generator and Related Ciphers
    Andreas Klein · 2013 · Springer eBooks
  58. Fast enumeration of words generated by Dyck grammars
    Yu. S. Medvedeva · 2014 · Mathematical Notes
  59. Random Walks and Rapid Mixing
    Cristopher Moore, Stephan Mertens · 2011 · Oxford University Press eBooks
  60. Fast Convolutions of Packed Strings and Pattern Matching with Wildcards
    Meng Zhang · 2017 · International Journal of Foundations of Computer Science
  61. Distant Decimals of $$\pi $$ π : Formal Proofs of Some Algorithms Computing Them and Guarantees of Exact Computation
    Yves Bertot, Laurence Rideau, Laurent Théry · 2017 · Journal of Automated Reasoning
  62. Algebraic and Logical Emulations of Quantum Circuits
    Kenneth W. Regan, Amlan Chakrabarti, Chaowen Guan · 2018 · Lecture notes in computer science
  63. Learning multiplication-free linear transformations
    Cristian Rusu · 2022 · Digital Signal Processing
  64. Parallelism in Computer Arithmetic: A Historical Perspective (Invited Paper)
    Behrooz Parhami · 2018 · IEEE International Midwest Symposium on Circuits and Systems (MWSCAS)
  65. Quadratic-Time Algorithms for Normal Elements
    Mark W. Giesbrecht, Armin Jamshidpey, Éric Schost · 2019 · International Symposium on Symbolic and Algebraic Computation
  66. An algorithm for computing the factor ring of an ideal in Dedekind domain with finite rank
    Dandan Huang, Yingpu Deng · 2017 · Science China Mathematics
  67. One Improved RLWE-based FHE and Fast Private Information Retrieval
    Weitao Song, Bin Hu and Xiu-Feng Zhao · 2019 · KSII Transactions on Internet and Information Systems
  68. Finding the Subsets of Variables of a Partial Boolean Function Which Are Sufficient for Its Implementation in the Classes Defined by Predicates
    N. G. Parvatov · 2020 · Journal of Applied and Industrial Mathematics
  69. Fast computation of the N-th term of a q-holonomic sequence and applications
    Alin Bostan, Sergey Yurkevich · 2022 · Journal of Symbolic Computation
  70. Energy-Efficient Digital Beamforming by Means of Linear Computation Coding
    Ralf R. Müller · 2021 · IEEE Statistical Signal Processing Workshop (SSP)
  71. Speedup of discrete Fourier transform by efficient modular arithmetic
    Yi Zhang, Mengdi Sun, Xin Qi · 2021 · Concurrency and Computation Practice and Experience
  72. Implementation of Multidigit Multiplication Basing on Discrete Cosine and Sine Transforms
    Andrii Tereshchenko, V. K. Zadiraka · 2021 · Cybernetics and Computer Technologies
  73. Parallel integer multiplication
    Samuel Vivien · 2022 · Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP)
  74. NP-Completeness
    2007 · Springer eBooks
  75. Polynomial Constructions of Chudnovsky-type Algorithms for Multiplication in Finite Fields with Linear Bilinear Complexity
    Stéphane Ballet, Alexis Bonnecaze, Bastien Pacifico · 2023 · Lecture notes in computer science
  76. Testing the Sharpness of Known Error Bounds on the Fast Fourier Transform
    Nicolas Brisebarre, Jean‐Michel Muller, Joris Picot · 2023 · IEEE Symposium on Computer Arithmetic (ARITH)
  77. Fast interpolation and multiplication of unbalanced polynomials
    Pascal Giorgi A, Bruno Grenet, Armelle Perret du Cray, Daniel S. Roche · 2024 · International Symposium on Symbolic and Algebraic Computation
  78. An improved deterministic algorithm for generalized random sampling
    Amihood Amir, Emanuel Dar · 1997 · Lecture notes in computer science
  79. Algorithms for Almost-Uniform Generation with an Unbiased Binary Source
    Ömer Eğeci̇oğlu, Marcus Peinado · 1998 · Lecture notes in computer science
  80. Spectral Modular Arithmetic for Cryptography
    G÷kay Saldamli, Çetin Kaya Koç · 2008 · Springer eBooks
  81. Algorithmique des courbes algébriques pour la cryptologie
    Pierrick Gaudry · 2008 · HAL
  82. High precision integer multiplication with a graphics processing unit
    Niall Emmart, Charles Weems · 2010 · IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum
  83. Two efficient algorithms for the computation of ideal sums in quadratic orders
    André Weilert · 2005 · Mathematics of Computation
  84. Fast numerical improvement of factors of polynomials and of partial fractions
    Peter Kirrinnis · 1998 · International Symposium on Symbolic and Algebraic Computation
  85. Testing permutation polynomials Extended Abstract
    Joachim von zur Gathen · 1989
  86. Bit complexity of matrix products
    Andrzej Lingas · 1991 · Information Processing Letters
  87. Issues in Implementation of Public Key Cryptosystems
    Jaewook Chung · 2006 · UWSpace (University of Waterloo)
  88. A new variational principle for the Euclidean distance function: Linear approach to the non-linear eikonal problem
    Karthik S. Gurumoorthy, Anand Rangarajan · 2011 · arXiv (Cornell University)
  89. Superpositions, Metric Entropy, Complexity of Functions, Widths
    G. G. Lorentz · 1997 · Birkhäuser Boston eBooks
  90. Optimization and Approximation
    Cristopher Moore, Stephan Mertens · 2011 · Oxford University Press eBooks
  91. Putting Fürer Algorithm into Practice with the BPAS Library
    Sviatoslav Covanov, Davood Mohajerani, Marc Moreno Maza, Linxiao Wang · 2018 · arXiv (Cornell University)
  92. Verifying nonrigidity
    P. Goralčík, Vácłav Koubek · 1986 · Information Processing Letters
  93. Time- and Space-Efficient Evaluation of Some Hypergeometric Constants
    Howard Cheng, Guillaume Hanrot, Emmanuel Thomé, Eugene V. Zima, Paul Zimmermann · 2007 · arXiv (Cornell University)
  94. High-precision computation of uniform asymptotic expansions for special functions
    Guillermo Navas-Palencia · 2019
  95. On Fast Computation of a Circulant Matrix-Vector Product
    Andreas Rosowski · 2021 · arXiv (Cornell University)
  96. Arithmetic of Polynomials, Rational Functions, and Power Series
    Keith O. Geddes, Stephen R. Czapor, George Labahn · 1992 · Springer eBooks
  97. All Pairs Shortest Paths via Matrix Multiplication
    Tadao Takaoka · 2008 · Springer eBooks
  98. All Pairs Shortest Paths via Matrix Multiplication
    Tadao Takaoka · 2016 · Springer eBooks
  99. Efficient and secure software implementation of post-quantum cryptosystems
    Décio Luiz Gazzoni Filho · 2024
  100. Advances in public-key cryptology and computer exploitation
    Rémi Géraud · 2017 · theses.fr (ABES)