Systems of Diophantine Equations over Finite Configurations

被引:0
|
作者
Kogabaev, N. T. [1 ]
机构
[1] Sobolev Inst Math, Novosibirsk, Russia
关键词
configuration; incidence; system of equations; computational complexity;
D O I
10.1134/S0037446623020076
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Under study are the finite systems of Diophantine equations over finite configurations. We propose some consistency verification procedure for such a system and use the output of the procedure to constructing the complete solution set. We estimate the running time of the procedure in general and distinguish the class of systems for which the consistency problem is decidable in polynomial time.
引用
收藏
页码:325 / 337
页数:13
相关论文
共 50 条