ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let C⊇P\mathcal{C} \supseteq \mathsf{P} be a standard complexity class, such as P\mathsf{P}, NP\mathsf{NP}, PSPACE\mathsf{PSPACE}, or EXP\mathsf{EXP}. Consider the semiring formed by the p-cardinalities of languages in C\mathcal{C}, together with the corresponding semiring of equivalence classes of p-cardinalities.

Non-finite-generation conjecture. For every such complexity class C\mathcal{C}, the semiring of p-cardinalities of languages in C\mathcal{C} is not finitely generated. The same holds for the semiring of equivalence classes of p-cardinalities.

This predicts a strong algebraic complexity phenomenon even within standard complexity classes, including P\mathsf{P}, NP\mathsf{NP}, PSPACE\mathsf{PSPACE}, and EXP\mathsf{EXP}. The supplied text gives no resolution, so both non-finite-generation assertions remain open.

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.