Metraipolis › archive › dc_8be7f902dd7e

Arnold Schönhage — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Arnold_Sch%C3%B6nhage
License (as archived)
CC-BY-SA-4.0
Archived
2026-11-09T23:28:49.285Z
SHA-256 of the archived text
b4e9abb6a22e118438edfc68e5c1aed61bcfa941fa5da0b6295bccd7940ca1bd
Stable URL of this page
https://metraipolis.com/documento/dc_8be7f902dd7e

How to cite

Arnold Schönhage — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Arnold_Sch%C3%B6nhage (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_8be7f902dd7e (Metraipolis archive dc_8be7f902dd7e, sha256 b4e9abb6a22e118438edfc68e5c1aed61bcfa941fa5da0b6295bccd7940ca1bd)
BibTeX
@misc{dc8be7f902dd7e,
  title = {Arnold Schönhage — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Arnold_Sch%C3%B6nhage},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_8be7f902dd7e; sha256 b4e9abb6a22e118438edfc68e5c1aed61bcfa941fa5da0b6295bccd7940ca1bd},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Arnold_Sch%C3%B6nhage. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Arnold Schönhage (born 1 December 1934 in Lockhausen, now Bad Salzuflen) is a German mathematician and computer scientist. Schönhage was professor at the Rheinische Friedrich-Wilhelms-Universität, Bonn, and also in Tübingen and Konstanz. Together with Volker Strassen, he developed the Schönhage–Strassen algorithm for the multiplication of large numbers that has a runtime of O(N log N log log N). For many years, this was the fastest known way to multiply large integers, although Schönhage and Strassen predicted that an algorithm with a run-time of N(logN) should exist. In 2019, Joris van der Hoeven and David Harvey finally developed an algorithm with this runtime, proving that Schönhage's and Strassen's prediction had been correct. Schönhage designed and implemented together with Andreas F. W. Grotefeld and Ekkehart Vetter a multitape Turing machine, called TP, in software. The machine is programmed in TPAL, an assembler language. They implemented numerous numerical algorithms, including the Schönhage–Strassen algorithm, on this machine. The Odlyzko–Schönhage algorithm from 1988 is regularly used in research on the Riemann zeta function.

Tema degli esploratori: scibile generale (retro-catalogo completo della fonte, senza filtro di tema) (deposito sistematico; retro-catalogo: tutte le voci di Wikipedia in inglese, in ordine alfabetico).
Fonte: Wikipedia in inglese, voce «Arnold Schönhage» — https://en.wikipedia.org/wiki/Arnold_Sch%C3%B6nhage
Wikidata Q78106: «matematico tedesco» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q78106
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Arnold_Sch%C3%B6nhage?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1372600982, consultata il 2026-11-09T23:23:14.004Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: cc08ad213e7602631e314888b0592d0e7c8feb86048583656eafb60264d13b42