1. S. L. Kryvyi, Linear Diophantine Equations and Their Applications (Bukrek, Kiev, 2015) [in Ukrainian].
2. V. V. Bykova, “Programming problems on graphs of bounded treewidth,” Program. Prod. Sist., No. 4, 101–106 (2011).
3. N. K. Kosovskii and T. M. Kosovskaya, “The number of steps for construction of a Boolean solution to polynomial congruences and systems of polynomial congruences,” Vestn. St. Petersburg Univ.: Math. 40, 218–223 (2007).
4. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP Completeness (Freeman, New York, 1979; Mir, Moscow, 1982).
5. L. J. Stockmeyer and A. R. Meyer, “Word problems requiring exponential time,” in Proc. 5th Annu. ACM Symp. on Theory of Computing (STOC '73), Austin, Texas, Apr. 30–May 2, 1973 (ACM, New York, 1973), pp. 1–9.