Abstract
Consider the Frobenius Problem: Given positive integersa 1,...,a n witha i ≥ 2 and such that their greatest common divisor is one, find the largest natural number that is not expressible as a non-negative integer combination ofa 1,...,a n. In this paper we prove that the Frobenius problem is NP-hard, under Turing reductions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Brauer andJ. E. Shockley: On a Problem of Frobenius,Journal für reine und angewandte Mathematik,211 (1962), 399–408.
M. R. Garey andD. S. Johnson:Computers and Intractability: A Guide to the Theory of NP-completeness, W. H. Freeman and Company, N.Y., 1979.
H. Greenberg: Solution to a linear diophantine equation for nonegative integers,Journal of Algorithms,9 (1988), 343–353.
M. Grötschel, L. Lovász andA. Schrijver:Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, 1988.
M. Hujter andB. Vizvári: The exact solution to the Frobenius Problem with three variables.Journal of the Ramanujan Math. Soc.,2 (1987), 117–143.
R. Kannan: Lattice Translates of a Polytope and the Frobenius problem.Combinatorica,12 (2), (1992), 161–177.
R. Kannan: private communication, 1994.
C. H. Papadimitriou andK. Steiglitz:Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Inc., 1982.
O. J. Rödseth: On a linear diophantine problem of Frobenius,Journal für reine und angewandte Mathematik,301 (1968), 171–178.
H. E. Scarf andD. Shallcross: The Frobenius problem and maximal lattice three bodies, Manuscript, (1989).
E. S. Selmer: On the linear diophantine problem of Frobenius,Journal für reine und angewandte Mathematik,293/294 (1977), 1–17.
E. S. Selmer andO. Beyer: On the linear diophantine problem of Frobenius in three variables,Journal für reine und angewandte Mathematik,301 (1978), 161–170.