NP-completeness conditions for some types of systems of linear diophantine comparisons and equations consistency checking
DOI:
https://doi.org/10.21638/11701/spbu01.2016.202Abstract
-Downloads
Download data is not yet available.
References
Литература
1. Косовский Н.К., Косовская Т.М., Косовский Н.Н. Условия NP-полноты проверки совместности нескольких видов систем линейных диофантовых дизсравнений // Вестник С-Петерб. ун-та. Сер. 1. 2016. Т. 3(61), вып. 1. С. 25-31.
2. Zhe Feng Xu. On the difference between an integer and its m-th power mod n // Sci. China Math. 2013. Vol. 56, N 8. P. 1597-1606.
3. Hernando A., de Ledesma L., Laita L.M. Showing the non-existence of solutions in systems of linear Diophantine equations // Mathematics and Computers in Simulation. 2009. Vol. 79, Issue 11. P. 3211-3220.
4. Feng Jiejian, Liu Liming, Wan Yat-wah. Irreducibility of joint inventory positions in an assembleto-order system under (r, nQ) policies // Naval Research Logistics (NRL). 2012. Vol. 59, Issue 1. P. 18-25.
5. Гэри М., Джонсон Д. Вычислительные машины и труднорешаемые задачи. М.: Мир, 1982.
6. Схрейвер А. Теория линейного и целочисленного программирования. Т. 2. М.: Мир, 1991.
References
1. Kosovskii N.K., Kosovskaya T.M., Kosovskii N.N., “NP-completeness conditions for some types of systems of linear Diophantine dis-comparisons consistency checking”, Vestnik St. Petersburg. Univ.: Math. 49, Issue 1, 18–22 (2016).
2. Zhe Feng Xu, “On the difference between an integer and its m-th power mod n”, Sci. China Math. 56(8), 1597–1606 (2013).
3. Hernando A.,de Ledesma L., Laita L.M., “Showing the non-existence of solutions in systems of linear Diophantine equations”, Mathematics and Computers in Simulation 79, Issue 11, 3211–3220 (2009).
4. Feng Jiejian, Liu Liming, Wan Yat-wah, “Irreducibility of joint inventory positions in an assembleto- order system under (r, nQ) policies”, Naval Research Logistics (NRL) 59, Issue 1, 18–25 (2012).
5. Garey M.R., Johnson D. S., Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979).
6. Schrijver A., Theory of Linear and Integer Programming. A Wiley-Interscience Publication (John Wiley & Sons, New York, 1986).
Downloads
Published
2020-10-19
How to Cite
Kosovskii, N. K., Kosovskaya, T. M., & Kosovskii, N. N. (2020). NP-completeness conditions for some types of systems of linear diophantine comparisons and equations consistency checking. Vestnik of Saint Petersburg University. Mathematics. Mechanics. Astronomy, 3(2), 1. https://doi.org/10.21638/11701/spbu01.2016.202
Issue
Section
Mathematics
License
Articles of "Vestnik of Saint Petersburg University. Mathematics. Mechanics. Astronomy" are open access distributed under the terms of the License Agreement with Saint Petersburg State University, which permits to the authors unrestricted distribution and self-archiving free of charge.
