The area-time complexity of the greatest common divisor problem: A lower bound (Q910227)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:910227 |
scientific article; zbMATH DE number 4139298
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The area-time complexity of the greatest common divisor problem: A lower bound |
scientific article; zbMATH DE number 4139298 |
Statements
The area-time complexity of the greatest common divisor problem: A lower bound (English)
0 references
1990
0 references
area-time complexity
0 references
integer arithmetic
0 references
area-time lower bounds
0 references
VLSI model of computation
0 references
greatest common divisor
0 references
0.7781053185462952
0 references
0.7777990102767944
0 references
