The complexity of the extended GCD problem
From MaRDI portal
Recommendations
- The complexity of approximate optima for greatest common divisor computations
- scientific article; zbMATH DE number 1253972
- scientific article; zbMATH DE number 1156678
- An improved lower bound for approximating minimum GCD multiplier in \(\ell _\infty \) norm (GCDM\(_\infty\))
- scientific article; zbMATH DE number 799777
Cited in
(6)- scientific article; zbMATH DE number 1254257 (Why is no real title available?)
- scientific article; zbMATH DE number 1156678 (Why is no real title available?)
- scientific article; zbMATH DE number 3995051 (Why is no real title available?)
- scientific article; zbMATH DE number 799777 (Why is no real title available?)
- An improved lower bound for approximating minimum GCD multiplier in \(\ell _\infty \) norm (GCDM\(_\infty\))
- Jug measuring: algorithms and complexity
This page was built for publication: The complexity of the extended GCD problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4941893)