Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 1461539

From MaRDI portal
Publication:4485869
Jump to:navigation, search

zbMATH Open0983.11073MaRDI QIDQ4485869FDOQ4485869


Authors: Charles C. Y. Lam, Scott A. Vanstone, Jeffrey Shallit Edit this on Wikidata


Publication date: 20 June 2000



Title of this publication is not available (Why is that?)



Recommendations

  • scientific article; zbMATH DE number 799776
  • scientific article; zbMATH DE number 1254258
  • A modular integer GCD algorithm


zbMATH Keywords

complexitygreatest common divisorde Rooij exponentiation methodde Rooij's algorithm


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Number-theoretic algorithms; complexity (11Y16)



Cited In (4)

  • Title not available (Why is that?)
  • Guest editorial: Special issue in honor of Scott A. Vanstone
  • The Brun gcd algorithm in high dimensions is almost always subtractive
  • Title not available (Why is that?)





This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4485869)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4485869&oldid=18565776"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 06:54. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki