Schnelle Multiplikation großer Zahlen

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

Cited by (1,000)

Items 901–1,000 of 1,000

  1. Multiplication algorithms : bilinear complexity and fast asymptotic methods
    Svyatoslav Covanov · 2018 · theses.fr (ABES)
  2. Fast finite field arithmetic
    Robin Larrieu · 2019 · theses.fr (ABES)
  3. Quantitative and algorithmic analysis of concurrent programs
    Martin Pépin · 2021 · theses.fr (ABES)
  4. Fast convolution-based methods for computing the signed distance function and its derivatives
    Karthik S. Gurumoorthy, Anand Rangarajan, Manu Sethi · 2011
  5. Aspekty algorytmiczne organizacji układu do mnożenia długich operandów
    M. Gliszczyński, A. Tariov · 2010 · Pomiary Automatyka Kontrola
  6. WORKSHOP ee (ELECTRONIC MONEY)
    Michael Nüsken · 2008
  7. Big Integers and Rational Arithmetic
    Ronald T. Kneusel · 2015 · Springer eBooks
  8. Wie kann man Primzahlen erkennen?
    Paulo Ribenboim · 2011 · Springer-Lehrbuch
  9. La obra de Leslie Valiant
    J. Andrés Montoya · 2014 · Dialnet (Universidad de la Rioja)
  10. Enforcing Security with Cryptography
    Sami Harari, Laurent Poinsot · 2013 · Wiley eBooks
  11. Festschrift in honor of Arnold Schönhage
    Thomas Lickteig · 2005 · Journal of Complexity
  12. Aceleración hardware con propósitos criptográficos
    Javier Pérez Rico · 2013 · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)
  13. Effizienz von Algorithmen
    Armin P. Barth · 2013 · Springer eBooks
  14. Fast algebraic convolution for prime power lengths
    Reiner Manfred Creutzburg, Torsten Minkwitz · 2002 · IEEE International Conference on Electronics, Circuits and Systems (ICECS)
  15. Abelian Hidden Subgroup Problem
    Michele Mosca · 2015 · Springer eBooks
  16. Improving the Berlekamp Algorithm for Binomials x n − a
    Ryuichi Harasawa, Yutaka Sueyoshi, Aichi Kudo · 2012 · Lecture notes in computer science
  17. Code Generation for Polynomial Multiplication
    Ling Ding, Éric Schost · 2009 · Lecture notes in computer science
  18. Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size
    Beate Bollig, Marc Gillé · 2011 · Lecture notes in computer science
  19. The bit-cost of some algorithms for the solution of linear systems
    Bruno Codenotti · 1988 · Computers & Mathematics with Applications
  20. Asymptotically fast algorithms for modern computer algebra
    Jürgen Gerhard · 2010 · International Symposium on Symbolic and Algebraic Computation
  21. An improved deterministic algorithm for generating different many-element random samples
    Amihood Amir, Emanuel Dar · 1997 · Information Processing Letters
  22. Randomized OBDDs for the most significant bit of multiplication need exponential space
    Beate Bollig, Marc Gillé · 2010 · Information Processing Letters
  23. A Fast Algorithm for Computing Binomial Coefficients Modulo Powers of Two
    Mugurel Ionuţ Andreica · 2013 · The Scientific World JOURNAL
  24. Finite approximate approach to the study of the complexity of recursive predicates
    R. I. Freidson · 1978 · Journal of Soviet Mathematics
  25. Time-space efficient algorithms for computing convolutions and related problems
    David A. Carlson · 1987 · Information and Computation
  26. Fast fourier transforms over poor fields
    Alexey Pospelov · 2011 · International Symposium on Symbolic and Algebraic Computation
  27. Computing tournament sequence numbers efficiently with matrix techniques.
    Erich Neuwirth · 2002 · Séminaire Lotharingien de Combinatoire [electronic only]
  28. Analyse numérique et réduction de réseaux
    Ivan Morel, Damien Stehlé, Gilles Villard · 2010 · Techniques et sciences informatiques
  29. Algorithmen – Berechenbarkeit und Komplexität
    Hartmut Ernst, Jochen Schmidt, Gerd Beneken · 2015 · Springer eBooks
  30. A Polynomial-Time Algorithm for the Planar Quantified Integer Programming Problem
    Zhiyao Liang, K. Subramani · 2011 · Advances in intelligent and soft computing
  31. The multiplication of very large integers using the discrete fast Fourier transform
    Daniel Guinier · 1991 · ACM SIGSAC Review
  32. Solving structured linear systems of large displacement rank
    Alin Bostan, Claude-Pierre Jeannerod, Éric Schost · 2006 · ACM communications in computer algebra
  33. Computing in Algebraic Closures of Finite Fields
    Javad Doliskani · 2015 · Scholarship@Western (Western University)
  34. Ludicrously Large Numbers - Using Arbitrary Precision Arithmetic in SAS ® Applications
    Patrick Tan, Koen Vyverman · 2008
  35. TOWARD HIGH-PERFORMANCE POLYNOMIAL SYSTEM SOLVERS BASED
    On Triangular Decompositions, Xin Li · 2009
  36. ELEMENTARY AND SPECIAL FUNCTIONS Invited Paper 1
    Richard P. Brent · 1999
  37. Accuracy vs. complexity trade-off in simulations of future wireless networks
    Carlo Galiotto, Heather Crowley, Nicola Marchetti, Linda Doyle · 2015 · IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)
  38. Time -an dSpace-Efficien tEvaluatio no fSome Hypergeometric Constants
    Howard Cheng, Eugene V. Zima, Paul Zimmermann · 2007
  39. Über die Komplexität der Multiplikation in eingeschränkten Branchingprogrammmodellen
    Philipp Wölfel · 2003 · Technische Universität Dortmund Eldorado (Technische Universität Dortmund)
  40. Extending the Precision
    Jean‐Michel Muller, Nicolas Brisebarre, Florent Dupont de Dinechin, Claude-Pierre Jeannerod, Vincent Lefèvre, Guillaume Melquiond, Nathalie Revol, Damien Stehlé, Serge Torres · 2009 · Birkhäuser Boston eBooks
  41. Parameter Selection Refinement and Software Implementations of Spectral Modular Exponentiation
    Estes, Matthew · 2010
  42. Evaluation of Modular Algorithms for High-precision Evaluation of Hypergeometric Constants
    Howard Cheng, Christopher Martin · 2012 · Proceedings of the ... annual International Conference on Computational Mathematics, Computational Geometry & Statistics/Proceedings of the ... annual International Conference on International Conference on Computational Mathematics, Computational Geometry & Statistics
  43. О реализации умножения полиномиальных матриц над полем $GF(2)$ с помощью быстрого преобразования Фурье
    Рыжов Александр Сергеевич · 2013 · Дискретная математика
  44. Быстрая нумерация слов, порождаемых грамматиками Дика
    Юлия Сергеевна Медведева, Yuliya Sergeevna Medvedeva · 2014 · Математические заметки
  45. Is Binary Notation Optimal?
    Klaus Weihrauch · 1981 · American Mathematical Monthly
  46. Learning Poisson Binomial Distributions (Extended Abstract)
    Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio · 2012
  47. Computation of π using arithmetic-geometric mean (1976)
    Eugene Salamin · 2016 · Springer eBooks
  48. Needles in a Haystack: the Class NP
    Cristopher Moore, Stephan Mertens · 2011 · Oxford University Press eBooks
  49. The Deep Question: P vs. NP
    Cristopher Moore, Stephan Mertens · 2011 · Oxford University Press eBooks
  50. Counting, Sampling, and Statistical Physics
    Cristopher Moore, Stephan Mertens · 2011 · Oxford University Press eBooks
  51. Insights and Algorithms
    Cristopher Moore, Stephan Mertens · 2011 · Oxford University Press eBooks
  52. Simultaneous methods for polynomial zeros
    Miodrag S. Petković, Beny Neta, Ljiljana D. Petković, Jovana Džunić · 2012 · Elsevier eBooks
  53. The Grand Unified Theory of Computation
    Moore Cristopher · 2011 · Oxford University Press eBooks
  54. Interaction and Pseudorandomness
    Cristopher Moore, Stephan Mertens · 2011 · Oxford University Press eBooks
  55. Who is the Hardest One of All? NP-Completeness
    Cristopher Moore, Stephan Mertens · 2011 · Oxford University Press eBooks
  56. When Formulas Freeze: Phase Transitions in Computation
    Cristopher Moore, Stephan Mertens · 2011 · Oxford University Press eBooks
  57. Memory, Paths, and Games
    Cristopher Moore, Stephan Mertens · 2011 · Oxford University Press eBooks
  58. A Quantum Algorithm for the Ferromagnetic Ising Model (Manuscript in preparation)
    Ashwin Nayak, Universityof Waterloo, Leonard J. Schulman, Umesh V. Vazirani · 2008
  59. Faster Polynomial Multiplication via Discrete Fourier Transforms
    Alexey Pospelov · 2010 · arXiv (Cornell University)
  60. Computing with Integers
    Stefan Hougardy, Jens Vygen · 2016 · Springer eBooks
  61. Public-key Cryptography on SIMD Mobile Devices
    Alves Martins · 2014
  62. A collection of patterns for prime generation
    Teresa Joven, José Carlos Ciria · 2016 · European Conference on Pattern Languages of Programs
  63. Spectral arithmetic in Montgomery modular multiplication
    Wangchen Dai, Ray C. C. Cheung · 2017 · Journal of Cryptographic Engineering
  64. DOCTEUR DE L'UNIVERSITÉ DE BORDEAUX
    Youssef Sbai · 2015
  65. The Combinatorics of Product Scanning Multiplication and Squaring
    Adam L. Young, Moti M. Yung · 2017 · Lecture notes in computer science
  66. Inversion of two new circulant matrices over Zm
    Yanpeng Zheng, Sugoog Shon, Zunwei Fu · 2017 · IOP Conference Series Earth and Environmental Science
  67. How to Enhance Student Motivations by Borrowing from Modern Practices: Can We Learn Algorithms from People Who Compute Fast
    Olga M. Kosheleva, Karen Villaverde · 2017 · Studies in computational intelligence
  68. Design of a fast number theoretical transform engine for fully homomorphic encryption
    Xiang Peng Feng, Shuguo Li · 2017 · IEEE International Symposium on Consumer Electronics (ISCE)
  69. A comparative complexity study of fixed-to-variable length and variable-to-fixed length source codes
    T.J. Tjalkens, Ruud Pellikaan · 2004 · TU/e Research Portal
  70. Beyond RAID 6 --- an Efficient Systematic Code Protecting Against Multiple Errors, Erasures, and Silent Data Corruption
    Moussa, Mohamad, Marek Ryszard Rychlik · 2018 · arXiv (Cornell University)
  71. Structured NC
    Bertha Scholten, Jan Van Leeuwen · 1989 · Lecture notes in computer science
  72. The whole can be very much less than the sum of its parts
    Peter Shiu · 2019 · The Mathematical Gazette
  73. Quadratic Probabilistic Algorithms for Normal Bases
    Mark W. Giesbrecht, Armin Jamshidpey, Éric Schost · 2019 · arXiv (Cornell University)
  74. Control Algorithm for Electric Plasma Propulsion and Real-Time Diffusion Simulation as Observer with Efficient Avionic Computer Systems
    Alexander Norbach · 2019 · International Conference on Recent Advances in Space Technologies
  75. Constraint-Based Privacy Preserving-Path Computation Element
    Hamid Hajaje, Mouhcine Guennoun, Zine El Abidine Guennoun · 2019 · International Journal of Smart Security Technologies
  76. Some Improvements of the Parallel Karatsuba Algorithm: Student paper
    Mirza Delibasic, Amra Habibovic, Naida Hanjalic, Envera Husagic · 2020 · International Symposium INFOTEH-JAHORINA (INFOTEH)
  77. Theoretical Computer Science: Computational Complexity
    Olivier Bournez A, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, Simon Perdrix, Sophie Tison · 2020 · Springer eBooks
  78. Large Number Multiplication by Repeated Addition
    B. Sukrith, A. Sreekumar · 2020 · Lecture notes in electrical engineering
  79. A Quantum Version of Pollard’s Rho of Which Shor’s Algorithm is a Particular Case
    Daniel Chicayban Bastos, Luis Antônio Brasil Kowada · 2022 · Lecture notes in computer science
  80. Circuits and Cost Functions
    Michal A. Mankowski, Mikhail Moshkov · 2021 · Studies in systems, decision and control
  81. Mathematics, Computing, and Arithmetic
    Duncan A. Buell · 2021 · Undergraduate topics in computer science
  82. Computing the depth distribution of a set of boxes
    Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma · 2021 · Theoretical Computer Science
  83. Further Steps Down The Wrong Path: Improving the Bit-Blasting of Multiplication.
    Martin Brain · 2021 · City Research Online (City University London)
  84. A unified FFT-based approach to maximum assignment problems related to transitive finite group actions
    Michael Valur Clausen · 2021 · Journal of Symbolic Computation
  85. Быстрые алгоритмы для считающих функций на свободных группах и свободных моноидах
    Alexey Leonidovich Talambutsa, Tobias Hartnick · 2023 · Математический сборник
  86. A quantum algorithm for computing the Carmichael function
    Juan Carlos García-Escartín · 2021 · arXiv (Cornell University)
  87. Algorithmen
    Hartmut Ernst · 2003 · Vieweg+Teubner eBooks
  88. A Certified Program for the Karatsuba Method to Multiply Polynomials
    S. D. Meshveliani · 2022 · Programming and Computer Software
  89. References
    Sándor Imre, Ferenc Balázs · 2004 · Wiley eBooks
  90. Low Complexity and High Speed Montgomery Multiplication Based on FFT
    B. Jyothi, M. Sucharitha, Anitha Patibandla · 2022 · Advances in intelligent systems and computing
  91. Algorithmen
    Hartmut Ernst · 2000 · Vieweg+Teubner eBooks
  92. NP-Completeness
    Bernhard Körte, Jens Vygen · 2000 · Algorithms and combinatorics
  93. NP-Completeness
    2005 · Springer eBooks
  94. Prologue
    Cristopher Moore, Stephan Mertens · 2011 · Oxford University Press eBooks
  95. Quantum Computation
    Cristopher Moore, Stephan Mertens · 2011 · Oxford University Press eBooks
  96. Ramanujan, Modular Equations, and Approximations to Pi or How to Compute One Billion Digits of Pi
    Jonathan Michael Borwein, Peter Borwein, David H. Bailey · 2004 · Springer eBooks
  97. Ramanujan, modular equations, and approximations to pi or how to compute one billion digits of pi (1989)
    Jonathan Michael Borwein, Peter Borwein, David H. Bailey · 2016 · Springer eBooks
  98. Multiprecision Multiplication
    Berk Sunar · 2011 · Springer eBooks
  99. B
    Michiel Hazewinkel · 2000 · Springer eBooks
  100. Vectorization of Multiple-Precision Arithmetic Program and 201,326,000 Decimal Digits of π Calculation
    Yasumasa Kanada · 2004 · Springer eBooks