The NP-completeness of the consistency problem for systems of Diophantine equations over finite configurations Full article

Journal	Siberian Mathematical Journal ISSN: 0037-4466 , E-ISSN: 1573-9260
Output data	Year: 2025, Volume: 66, Number: 3, Pages: 702-714 Pages count : 13 DOI: 10.1134/S0037446625030103
Tags	configuration, incidence, system of equations, nondeterministic Turing machine, NP-complete problem
Authors	Kogabaev N.T. 1,2
Affiliations	1 Sobolev Institute of Mathematics 2 Novosibirsk State University

Funding (1)

1

Russian Science Foundation

23-11-00170