Subpower membership conjecture for algebras with few subpowers
Statement
Let be a finite algebra, and say that it has few subpowers when the equivalent conditions in the source's Few Subpowers theorem hold. Given a finite subset and an element , the subpower membership problem asks whether belongs to the subalgebra of generated by . Few-subpowers subpower-membership conjecture. If has few subpowers, then the subpower membership problem can be solved in polynomial time. The source presents this as an open question; general instances can be EXPTIME-complete, while stronger hardness results cover many algebras without few subpowers.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.