頌哈吉-施特拉森演算法 (Chinese Wikipedia)
Analysis of information sources in references of the Wikipedia article "頌哈吉-施特拉森演算法" in Chinese language version.
refsWebsite
Global rank
Chinese rank
1st place
1st place
274th place
320th place
11th place
332nd place
6,328th place
8,082nd place
low place
low place
low place
low place
383rd place
336th place
arxiv.org
- Van Meter, Rodney; Itoh, Kohei M. Fast Quantum Modular Exponentiation. Physical Review. A. 2005, 71 (5): 052320. S2CID 14983569. arXiv:quant-ph/0408006
. doi:10.1103/PhysRevA.71.052320.
doi.org
- Van Meter, Rodney; Itoh, Kohei M. Fast Quantum Modular Exponentiation. Physical Review. A. 2005, 71 (5): 052320. S2CID 14983569. arXiv:quant-ph/0408006 . doi:10.1103/PhysRevA.71.052320.
github.com
- An improved BigInteger class which uses efficient algorithms, including Schönhage–Strassen. Oracle. [2014-01-10].
gmplib.org
- MUL_FFT_THRESHOLD. GMP developers' corner. [3 November 2011]. （原始内容存档于24 November 2010）.
loria.fr
- Pierrick Gaudry, Alexander Kruppa, and Paul Zimmermann. A GMP-based Implementation of Schönhage–Strassen’s Large Integer Multiplication AlgorithmArchived. Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, pp.167–174.
psu.edu
cse.psu.edu
- Martin Fürer, "Faster integer multiplication 互联网档案馆的存檔，存档日期2013-04-25.", STOC 2007 Proceedings, pp. 57–66.
semanticscholar.org
api.semanticscholar.org
- Van Meter, Rodney; Itoh, Kohei M. Fast Quantum Modular Exponentiation. Physical Review. A. 2005, 71 (5): 052320. S2CID 14983569. arXiv:quant-ph/0408006 . doi:10.1103/PhysRevA.71.052320.
springer.com
link.springer.com
- A. Schönhage and V. Strassen, "Schnelle Multiplikation großer Zahlen （页面存档备份，存于互联网档案馆）", Computing 7 (1971), pp. 281–292.
tu-darmstadt.de
cdc.informatik.tu-darmstadt.de
- Luis Carlos Coronado García, "Can Schönhage multiplication speed up the RSA encryption or decryption? Archived", University of Technology, Darmstadt (2005)
usyd.edu.au
magma.maths.usyd.edu.au
- Overview of Magma V2.9 Features, arithmetic section 互联网档案馆的存檔，存档日期2006-08-20.: Discusses practical crossover points between various algorithms.
web.archive.org
- A. Schönhage and V. Strassen, "Schnelle Multiplikation großer Zahlen （页面存档备份，存于互联网档案馆）", Computing 7 (1971), pp. 281–292.
- Martin Fürer, "Faster integer multiplication 互联网档案馆的存檔，存档日期2013-04-25.", STOC 2007 Proceedings, pp. 57–66.
- Overview of Magma V2.9 Features, arithmetic section 互联网档案馆的存檔，存档日期2006-08-20.: Discusses practical crossover points between various algorithms.
- Luis Carlos Coronado García, "Can Schönhage multiplication speed up the RSA encryption or decryption? Archived", University of Technology, Darmstadt (2005)
- MUL_FFT_THRESHOLD. GMP developers' corner. [3 November 2011]. （原始内容存档于24 November 2010）.
- Pierrick Gaudry, Alexander Kruppa, and Paul Zimmermann. A GMP-based Implementation of Schönhage–Strassen’s Large Integer Multiplication AlgorithmArchived. Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, pp.167–174.