| Display title | Fürer's algorithm |
| Default sort key | Furer'S Algorithm |
| Page length (in bytes) | 7,883 |
| Namespace ID | 0 |
| Page ID | 260987 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>Rtexter1 |
| Date of page creation | 04:28, 1 December 2022 |
| Latest editor | imported>Rtexter1 |
| Date of latest edit | 04:28, 1 December 2022 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | Fürer's algorithm is an integer multiplication algorithm for extremely large integers with very low asymptotic complexity. It was published in 2007 by the Swiss mathematician Martin Fürer of Pennsylvania State University as an asymptotically faster algorithm when analysed on a multitape Turing machine... |
