scientific article; zbMATH DE number 1418331
From MaRDI portal
Publication:4941893
zbMath0996.11077MaRDI QIDQ4941893
Jean-Pierre Seifert, George Havas
Publication date: 4 November 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
approximation algorithmsNP-hardnessprobabilistically checkable proofsinteractive proof systems\(\ell_2\)-norm GCD multiplier problemcomputational problems of Diophantine equationsextended gcd computations
Computer solution of Diophantine equations (11Y50) Number-theoretic algorithms; complexity (11Y16) Approximation algorithms (68W25)
Related Items (2)
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:
