Polynomial-time tractability of subpower membership for finite Mal'cev algebras

Determine whether the subpower membership problem [?] for every finite Mal'cev algebra of finite type belongs to the complexity class P.

Background

The paper introduces the subpower membership problem SMP(A) as the decision problem of determining whether a tuple belongs to the subalgebra of a finite power A^n generated by specified tuples. Polynomial-time tractability is known for several important classes, including finite groups, finite rings, modules, finite supernilpotent Mal'cev algebras, and additional classes covered by prior results.

The question asks whether this tractability extends to every finite Mal'cev algebra of finite type. The paper investigates this broader problem through restricted classes of nilpotent Mal'cev algebras but does not resolve it in full generality.