Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование
The NP-completeness of the Consistency Problem for Systems of Diophantine Equations over Finite Configurations. / Kogabaev, N. t.
в: Siberian Mathematical Journal, Том 66, № 3, 02.06.2025, стр. 702-714.Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование
}
TY - JOUR
T1 - The NP-completeness of the Consistency Problem for Systems of Diophantine Equations over Finite Configurations
AU - Kogabaev, N. t.
N1 - The work was supported by the Russian Science Foundation (Project 23–11–00170, https://rscf.ru/project/23-11-00170).
PY - 2025/6/2
Y1 - 2025/6/2
N2 - Studying finite systems of Diophantine equations over finite configurations, we prove that the consistency problem for such systems is NP-complete.
AB - Studying finite systems of Diophantine equations over finite configurations, we prove that the consistency problem for such systems is NP-complete.
UR - https://www.scopus.com/record/display.uri?eid=2-s2.0-105007079614&origin=inward&txGid=f7d8233f9e7bac621e2c40ee2c09bb8b
U2 - 10.1134/S0037446625030103
DO - 10.1134/S0037446625030103
M3 - Article
VL - 66
SP - 702
EP - 714
JO - Siberian Mathematical Journal
JF - Siberian Mathematical Journal
SN - 0037-4466
IS - 3
ER -
ID: 67648660