A carry-free algorithm for finding the greatest common divisor of two integers (Q1051425): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0898-1221(83)90133-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2054255249 / rank | |||
Normal rank | |||
Latest revision as of 18:43, 21 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A carry-free algorithm for finding the greatest common divisor of two integers |
scientific article |
Statements
A carry-free algorithm for finding the greatest common divisor of two integers (English)
0 references
1983
0 references
binary algorithm
0 references
carry-save hardware
0 references
hardware implementation
0 references
secure data transmission
0 references
