1. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity (Prentice-Hall, Englewood Cliffs, 1982).
2. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness (Freeman, San Francisco, 1979).
3. V. M. Fomichev and D. A. Mel’nikov, Cryptographic Methods of Information Security (Urait, Moscow, 2017).
4. P. Erdős and R. L. Graham, “On a linear Diophantine problem of Frobenius,” Acta Arith. 21, 399–408 (1972).
5. J. R. Alfonsin, The Diophantine Frobenius Problem (Oxford University Press, Oxford, 2005).