The NP-completeness of the Consistency Problem for Systems of Diophantine Equations over Finite Configurations

Studying finite systems of Diophantine equations over finite configurations, we prove that the consistency problem for such systems is NP-complete.

Authors

Institutions

Publication Details

Journal
Siberian Mathematical Journal
Published
2025-05-01
DOI
https://doi.org/10.1134/s0037446625030103
Primary Topic
Artificial Intelligence in Games
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The NP-completeness of the Consistency Problem for Systems of Diophantine Equations over Finite Configurations

N. T. Kogabaev
Siberian Mathematical Journal
Artificial Intelligence in Games
article

The NP-completeness of the Consistency Problem for Systems of Diophantine Equations over Finite Configurations

N. T. Kogabaev
article en

Abstract

Studying finite systems of Diophantine equations over finite configurations, we prove that the consistency problem for such systems is NP-complete.

Siberian Mathematical JournalVol. 66(3)
Novosibirsk State University (RU), Sobolev Institute of Mathematics (RU)
Openalex Percentile: Top 94%
Artificial Intelligence in Games
DOISourceOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

The NP-completeness of the Consistency Problem for Systems of Diophantine Equations over Finite Configurations — N. T. Kogabaev · Siberian Mathematical Journal (2025) | TGRS Research Map | TGRS