|
Sibirskii Matematicheskii Zhurnal, 2025, Volume 66, Number 3, Pages 450–464 DOI: https://doi.org/10.33048/smzh.2025.66.310
(Mi smj7956)
|
|
|
|
The np-completeness of the consistency problem for systems of Diophantine equations over finite configurations
N. T. Kogabaevab a Sobolev Institute of Mathematics, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
DOI:
https://doi.org/10.33048/smzh.2025.66.310
Abstract:
Studying finite systems of Diophantine equations over finite configurations, we prove that the consistency problem for such systems is NP-complete.
Keywords:
configuration, incidence, system of equations, nondeterministic Turing machine, NP-complete problem.
Received: 14.11.2024 Revised: 14.11.2024 Accepted: 25.04.2025
Citation:
N. T. Kogabaev, “The np-completeness of the consistency problem for systems of Diophantine equations over finite configurations”, Sibirsk. Mat. Zh., 66:3 (2025), 450–464; Siberian Math. J., 66:3 (2025), 702–714
Linking options:
https://www.mathnet.ru/eng/smj7956 https://www.mathnet.ru/eng/smj/v66/i3/p450
|
|