About: Fürer's algorithm

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Fürer's algorithm Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

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 of Pennsylvania State University as an asymptotically faster algorithm when analysed on a multitape Turing machine than its predecessor, the Schönhage–Strassen algorithm. It is used in the Basic Polynomial Algebra Subprograms (BPAS) open source library.

Attributes	Values
rdfs:label	Fürer's algorithm (en)
rdfs:comment	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 of Pennsylvania State University as an asymptotically faster algorithm when analysed on a multitape Turing machine than its predecessor, the Schönhage–Strassen algorithm. It is used in the Basic Polynomial Algebra Subprograms (BPAS) open source library. (en)
sameAs	Fürer's algorithm
dbp:wikiPageUsesTemplate	dbt:Merge_to dbt:Reflist dbt:Number-theoretic_algorithms dbt:Log-star
Subject	Computer arithmetic algorithms
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Fürer's_algorithm?oldid=1074590588&ns=0
Wikipage page ID	16113963 (xsd:integer)
page length (characters) of wiki page	7826 (xsd:nonNegativeInteger)
Wikipage revision ID	1074590588 (xsd:integer)
Link from a Wikipage to another Wikipage	Arnold Schönhage Volker Strassen Computer arithmetic algorithms Joris van der Hoeven Discrete Fourier transform (general) Mersenne prime Computational complexity Minkowski's theorem Galactic algorithm Schönhage–Strassen algorithm Fast Fourier transform Fermat number Modular arithmetic Iterated logarithm Multiplication algorithm dbr:Martin_Fürer
has abstract	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 of Pennsylvania State University as an asymptotically faster algorithm when analysed on a multitape Turing machine than its predecessor, the Schönhage–Strassen algorithm. It is used in the Basic Polynomial Algebra Subprograms (BPAS) open source library. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Fürer's_algorithm
is Wikipage redirect of	Furer's algorithm Harvey-Hoeven algorithm Fürer algorithm Fürer multiplication
is Link from a Wikipage to another Wikipage of	Proof that 22/7 exceeds π Arbitrary-precision arithmetic List of numerical analysis topics Computational complexity of mathematical operations List of algorithms Miller–Rabin primality test Furer's algorithm Harvey-Hoeven algorithm Lucas primality test Fürer algorithm Fürer multiplication Iterated logarithm Multiplication algorithm
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Fürer's_algorithm

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software