Standard

The NP-completeness of the Consistency Problem for Systems of Diophantine Equations over Finite Configurations. / Kogabaev, N. t.

In: Siberian Mathematical Journal, Vol. 66, No. 3, 02.06.2025, p. 702-714.

Research output: Contribution to journal › Article › peer-review

Harvard

Kogabaev, NT 2025, 'The NP-completeness of the Consistency Problem for Systems of Diophantine Equations over Finite Configurations', Siberian Mathematical Journal, vol. 66, no. 3, pp. 702-714. https://doi.org/10.1134/S0037446625030103

APA

Kogabaev, N. T. (2025). The NP-completeness of the Consistency Problem for Systems of Diophantine Equations over Finite Configurations. Siberian Mathematical Journal, 66(3), 702-714. https://doi.org/10.1134/S0037446625030103

Vancouver

Kogabaev NT. The NP-completeness of the Consistency Problem for Systems of Diophantine Equations over Finite Configurations. Siberian Mathematical Journal. 2025 Jun 2;66(3):702-714. doi: 10.1134/S0037446625030103

Author

Kogabaev, N. t. / The NP-completeness of the Consistency Problem for Systems of Diophantine Equations over Finite Configurations. In: Siberian Mathematical Journal. 2025 ; Vol. 66, No. 3. pp. 702-714.

BibTeX

@article{262f6aea9339486badbbfbcd5cb46476,
title = "The NP-completeness of the Consistency Problem for Systems of Diophantine Equations over Finite Configurations",
abstract = "Studying finite systems of Diophantine equations over finite configurations, we prove that the consistency problem for such systems is NP-complete.",
author = "Kogabaev, {N. t.}",
note = "The work was supported by the Russian Science Foundation (Project 23–11–00170, https://rscf.ru/project/23-11-00170). ",
year = "2025",
month = jun,
day = "2",
doi = "10.1134/S0037446625030103",
language = "English",
volume = "66",
pages = "702--714",
journal = "Siberian Mathematical Journal",
issn = "0037-4466",
publisher = "Pleiades Publishing",
number = "3",

}

RIS

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