Solvability of systems of polynomial equations over finite algebras

被引:1
|
作者
Zadori, Laszlo [1 ]
机构
[1] Bolyai Intezet, H-6720 Szeged, Hungary
基金
匈牙利科学研究基金会;
关键词
constraint satisfaction; varieties; systems of polynomial equations; complexity;
D O I
10.1142/S0218196707003809
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We study the algorithmic complexity of determining whether a system of polynomial equations over a finite algebra admits a solution. We prove that the problem has a dichotomy in the class of finite groupoids with an identity element. By developing the underlying idea further, we present a dichotomy theorem in the class of finite algebras that admit a non-trivial idempotent Maltsev condition. This is a substantial extension of most of the earlier results on the topic.
引用
收藏
页码:821 / 835
页数:15
相关论文
共 50 条