The area-time complexity of the greatest common divisor problem: A lower bound
type: Item
instance of: scholarly article
title: The area-time complexity of the greatest common divisor problem: A lower bound
zbMATH Open document ID: 0695.68044
DOI: 10.1016/0020-0190(90)90228-P
author: Carla Neaderhouser Purdy
author: George B. Purdy
published in: Information Processing Letters
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 4139298
zbMATH Keywords: area-time complexity
zbMATH Keywords: integer arithmetic
zbMATH Keywords: area-time lower bounds
zbMATH Keywords: VLSI model of computation
zbMATH Keywords: greatest common divisor
MaRDI profile type: Publication
cites work: Information transfer and area-time tradeoffs for VLSI multiplication
cites work: Area-time lower-bound techniques with applications to sorting
cites work: An algorithm with guaranteed convergence for finding a zero of a function
cites work: The Area-Time Complexity of Binary Multiplication
cites work: Fast Algorithms for Manipulating Formal Power Series
cites work: On problem transformability in VLSI
cites work: Q3935355
cites work: Area—Time optimal VLSI integer multiplier with minimum computation time
cites work: Q3219764
cites work: A carry-free algorithm for finding the greatest common divisor of two integers
cites work: Q4206400
cites work: Q3326832
description: scientific article; zbMATH DE number 4139298