ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let A\mathbb{A} 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 S⊆AnS\subseteq \mathbb{A}^n and an element x∈Anx\in \mathbb{A}^n, the subpower membership problem asks whether xx belongs to the subalgebra of An\mathbb{A}^n generated by SS. Few-subpowers subpower-membership conjecture. If A\mathbb{A} 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.