The NP-completeness column: An ongoing guide

DOI10.1016/0196-6774(86)90020-9zbMath0626.68038OpenAlexW2148043549MaRDI QIDQ5893777

David S. Johnson

Publication date: 1986

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(86)90020-9

zbMATH Keywords

primespolynomialsinteger latticesnumber theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (2)

Global minimization of univariate functions by sequential polynomial approximation ⋮ A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus$ via the Coin Problem]

This page was built for publication: The NP-completeness column: An ongoing guide