scientific article

From MaRDI portal

Revision as of 16:47, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3840151

Jump to:navigation, search

zbMath0918.11064MaRDI QIDQ3840151

Giovanni Cesari

Publication date: 23 August 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

tables algorithm greatest common divisor parallelization Schönhage's method

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Software, source code, etc. for problems pertaining to number theory (11-04) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Related Items (3)

An extended Jebelean^ WeberNSedjelmaci GCD algorithm ⋮ \((1+i)\)-ary GCD computation in \(\mathbb Z[i\) as an analogue to the binary GCD algorithm.] ⋮ Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3840151&oldid=17443872"