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

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

Original language	English
Pages (from-to)	702-714
Number of pages	13
Journal	Siberian Mathematical Journal
Volume	66
Issue number	3
DOIs	https://doi.org/10.1134/S0037446625030103
Publication status	Published - 2 Jun 2025

CONFIGURATION, incidence, SYSTEM OF EQUATIONS, NONDETERMINISTIC TURING MACHINE, NP-COMPLETE PROBLEM

ID: 67648660