The area-time complexity of the greatest common divisor problem: A lower bound (Q910227)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The area-time complexity of the greatest common divisor problem: A lower bound |
scientific article |
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
