The area-time complexity of the greatest common divisor problem: A lower bound

DOI10.1016/0020-0190(90)90228-PzbMATH Open0695.68044MaRDI QIDQ910227FDOQ910227

Authors: Carla Neaderhouser Purdy, George B. Purdy 

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 4126699
• scientific article; zbMATH DE number 4057005
• A modular integer GCD algorithm
• A lower bound for integer greatest common divisor computations
• scientific article; zbMATH DE number 3915623

zbMATH Keywords

greatest common divisorinteger arithmeticarea-time complexityarea-time lower boundsVLSI model of computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Title not available (Why is that?)
• Fast Algorithms for Manipulating Formal Power Series
• An algorithm with guaranteed convergence for finding a zero of a function
• Title not available (Why is that?)
• Area-time lower-bound techniques with applications to sorting
• On problem transformability in VLSI
• Information transfer and area-time tradeoffs for VLSI multiplication
• The Area-Time Complexity of Binary Multiplication
• Title not available (Why is that?)
• Area—Time optimal VLSI integer multiplier with minimum computation time
• A carry-free algorithm for finding the greatest common divisor of two integers
• Title not available (Why is that?)

Cited In (2)

• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: The area-time complexity of the greatest common divisor problem: A lower bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q910227)