Algorithm 386: Greatest common divisor of n integers and multipliers-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Algorithm 386: Greatest common divisor of n integers and multipliers

Published:1970-07 Issue:7 Volume:13 Page:447-448
ISSN:0001-0782
Container-title:Communications of the ACM
language:en
Short-container-title:Commun. ACM

Author:

Bradley Gordon H.¹

Affiliation:

1. Yale Univ. New Haven, CT

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Reference1 articles.

1. Algorithm and bound for the greatest common divisor of n integers

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A relation between the knapsack and group knapsack problems;Discrete Applied Mathematics;1998-10

2. Fast parallel Hermite normal form computation of matrices over $$\mathbb{F}[x]$$;Euro-Par’98 Parallel Processing;1998

3. Certification of algorithm 386 [A1];Communications of the ACM;1973-04

4. ALGORITHMS FOR HERMITE AND SMITH NORMAL MATRICES AND LINEAR DIOPHANTINE EQUATIONS;MATH COMPUT;1971

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP