A hard problem that is almost always easy

DOI10.1007/bfb0015426zbMath1512.68109MaRDI QIDQ6487965

George Havas, Bohdan S. Majewski

Publication date: 21 March 2023

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

An improved lower bound for approximating minimum GCD multiplier in \(\ell _\infty \) norm (GCDM\(_\infty\))

This page was built for publication: A hard problem that is almost always easy