scientific article; zbMATH DE number 1113848
From MaRDI portal
Publication:4375622
zbMath1021.68107MaRDI QIDQ4375622
Jean-Pierre Seifert, Carsten Rössner
Publication date: 1 March 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityapproximation algorithmNP-hardNP-completegcdprobabilistically checkable proofsapproximabilitylabel cover2-prover 1-round interactive proof systemsnumber theoretic optimization
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)
Related Items (2)
Approximate polynomial GCD over integers ⋮ An improved lower bound for approximating minimum GCD multiplier in \(\ell _\infty \) norm (GCDM\(_\infty\))
This page was built for publication:
