GCD of random linear combinations
type: Item
instance of: scholarly article
title: GCD of random linear combinations
zbMATH Open document ID: 1100.68129
author: Joachim von zur Gathen
author: Igor E. Shparlinski
published in: Algorithmica
publication date: 2006-10-16T00:00:00Z
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 11A05
Mathematics Subject Classification ID: 11Y16
zbMATH DE Number: 5064668
zbMATH Keywords: probabilistic algorithm
MaRDI profile type: Publication
full work available at URL: s00453-006-0072-1
OpenAlex ID: W2070972726
DOI: 10.1007/S00453-006-0072-1
Recommended article: Algorithms and Computation
Recommended article: Maximum GCD Among Pairs of Random Integers
Recommended article: Linear combination of Gumbel random variables
Recommended article: On the least common multiple of several random integers
Recommended article: Q5149077
Recommended article: Probabilistic computation of integer polynomial GCDs
Recommended article: The least common multiple of random sets of positive integers
Recommended article: Q3309911
Recommended article: On the degree of the GCD of random polynomials over a finite field
Recommended article: The determinants of GCD matrices
description: scientific article