Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Some Related Functions to Integer GCD and Coprimality

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

DOI10.1016/j.endm.2011.05.024zbMath1268.11162OpenAlexW2030656933MaRDI QIDQ2840696

Sidi Mohamed Sedjelmaci

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2011.05.024

zbMATH Keywords

algorithmsparallel complexitygreatest common divisor (GCD)


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Parallel algorithms in computer science (68W10)




Cites Work

  • An improved parallel algorithm for integer GCD
  • A parallel extended GCD algorithm
  • Fast computation of continued fraction expansions.
  • Two Fast GCD Algorithms
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2840696&oldid=15770036"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 20:21.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki