Q3740227
type: Item
instance of: scholarly article
zbMATH Open document ID: 0603.68037
author: Julian A Padget
author: James H. Davenport
publication date: 1985-01-01T00:00:00Z
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 11R06
Mathematics Subject Classification ID: 12-04
zbMATH DE Number: 3974286
zbMATH Keywords: greatest common divisor of polynomials
zbMATH Keywords: \({bbfZ}\)-adic computation
zbMATH Keywords: inequalities
MaRDI profile type: Publication
Recommended article: Simulation beats richness: new data-structure lower bounds
Recommended article: Q5743431
Recommended article: Bypassing UGC from Some Optimal Geometric Inapproximability Results
Recommended article: A Data-Driven McMillan Degree Lower Bound
Recommended article: Data reductions and combinatorial bounds for improved approximation algorithms
Recommended article: Reducing Computational Costs in the Basic Perturbation Lemma
Recommended article: Bit-Probe Lower Bounds for Succinct Data Structures
Recommended article: Bit-probe lower bounds for succinct data structures
description: scientific article