本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2001
摘要
We study the 計算 complexity of determining whether a systems of equations over a fixed finite monoid has a solution. In [6], it was shown that in the restricted case of groups the problem is tractable if the group is Abelian and NP-complete otherwise. We prove that in the case of an arbitrary finite monoid, the problem is in P if the monoid divides the direct product of an Abelian group and a commutative idempotent monoid, and is NP-complete otherwise. In the restricted case where only constants appear on the right-hand side, we show that the problem is in P if the monoid is in the class R-1 V L-1, and is NP-complete otherwise.
※ 此為已發表論文，全文需透過期刊付費取得