Algorithm and bound for the greatest common divisor of <i>n</i> integers (Q5591939): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/362686.362694 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1966466171 / rank | |||
Normal rank | |||
Latest revision as of 02:56, 20 March 2024
scientific article; zbMATH DE number 3311416
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithm and bound for the greatest common divisor of <i>n</i> integers |
scientific article; zbMATH DE number 3311416 |
Statements
Algorithm and bound for the greatest common divisor of <i>n</i> integers (English)
0 references
1970
0 references
computer science and automata
0 references
